The number 93807
93807 is a composite number with 12 divisors. Its prime factorisation is × 7 × 1489. Divisors (12): 1, 3, 7, 9, 21, 63, 1489, 4467, 10423, 13401, 31269, 93807.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93807: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
93807 is composite. Its prime factorisation is
- 3
The divisors add up to 154960; without 93807 itself that is 61153, so 93807 is deficient (61153 is less than 93807). Euler's totient φ(93807) = 53568 numbers up to 93807 share no factor with it.
- 4
The digits of 93807 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93807 = 3^{2} \times 7 \times 1489 \]93807 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 154960 |
| Euler totient φ(n) | 53568 |
| Square | 8799753249 |
| Cube | 825478453028943 |
| Square root | 306.279284 (= 3√10423) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3807 × |
93807 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand eight hundred and seven |
| Binary (base 2) | 10110111001101111 |
| Octal (base 8) | 267157 |
| Hexadecimal (base 16) | 16E6F |
| Base 3 | 11202200100 |
| As time | 93807 seconds = 26 h 3 min 27 s |
Is 93807 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 | Yes (93807 ÷ 3 = 31269) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (93807 ÷ 7 = 13401) | 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 | Yes (93807 ÷ 9 = 10423) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93807 a prime number?
No. 93807 = × 7 × 1489, so it is divisible by 3.
What are the factors of 93807?
1, 3, 7, 9, 21, 63, 1489, 4467, 10423, 13401, 31269, 93807.
What is 93807 in binary?
10110111001101111 (hexadecimal 16E6F, octal 267157).
What is the square root of 93807?
About 306.2793, exactly 3√10423.
Is 93807 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 93807?
93807 is a happy number: repeatedly adding the squares of its digits reaches 1.