The number 93223
93223 is a composite number with 8 divisors. Its prime factorisation is 13 × 71 × 101. Divisors (8): 1, 13, 71, 101, 923, 1313, 7171, 93223.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93223 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93223 is composite. Its prime factorisation is
- 3
The divisors add up to 102816; without 93223 itself that is 9593, so 93223 is deficient (9593 is less than 93223). Euler's totient φ(93223) = 84000 numbers up to 93223 share no factor with it.
- 4
The digits of 93223 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93223 = 13 \times 71 \times 101 \]
93223 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 102816 |
| Euler totient φ(n) | 84000 |
| Square | 8690527729 |
| Cube | 810157066480567 |
| Square root | 305.324418 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3223 × |
93223 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand two hundred and twenty-three |
| Binary (base 2) | 10110110000100111 |
| Octal (base 8) | 266047 |
| Hexadecimal (base 16) | 16C27 |
| Base 3 | 11201212201 |
| As time | 93223 seconds = 25 h 53 min 43 s |
Is 93223 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93223 a prime number?
No. 93223 = 13 × 71 × 101, so it is divisible by 13.
What are the factors of 93223?
1, 13, 71, 101, 923, 1313, 7171, 93223.
What is 93223 in binary?
10110110000100111 (hexadecimal 16C27, octal 266047).
What is the square root of 93223?
About 305.3244.
Is 93223 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 93223?
It is a composite number with 8 divisors.