The number 92001
92001 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 13 × 337. Divisors (16): 1, 3, 7, 13, 21, 39, 91, 273, 337, 1011, 2359, 4381, 7077, 13143, 30667, 92001.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 92001: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
92001 is composite. Its prime factorisation is
- 3
The divisors add up to 151424; without 92001 itself that is 59423, so 92001 is deficient (59423 is less than 92001). Euler's totient φ(92001) = 48384 numbers up to 92001 share no factor with it.
- 4
The digits of 92001 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92001 = 3 \times 7 \times 13 \times 337 \]
92001 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 151424 |
| Euler totient φ(n) | 48384 |
| Square | 8464184001 |
| Cube | 778713392276001 |
| Square root | 303.316666 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.2001 × |
92001 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand and one |
| Binary (base 2) | 10110011101100001 |
| Octal (base 8) | 263541 |
| Hexadecimal (base 16) | 16761 |
| Base 3 | 11200012110 |
| As time | 92001 seconds = 25 h 33 min 21 s |
Is 92001 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 (92001 ÷ 3 = 30667) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 (92001 ÷ 7 = 13143) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92001 a prime number?
No. 92001 = 3 × 7 × 13 × 337, so it is divisible by 3.
What are the factors of 92001?
1, 3, 7, 13, 21, 39, 91, 273, 337, 1011, 2359, 4381, 7077, 13143, 30667, 92001.
What is 92001 in binary?
10110011101100001 (hexadecimal 16761, octal 263541).
What is the square root of 92001?
About 303.3167.
Is 92001 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 92001?
92001 is a happy number: repeatedly adding the squares of its digits reaches 1.