The number 90064
90064 is a composite number with 20 divisors. Its prime factorisation is × 13 × 433. Divisors (20): 1, 2, 4, 8, 13, 16, 26, 52, 104, 208, 433, 866, 1732, 3464, 5629, 6928 … 90064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90064: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
90064 is composite. Its prime factorisation is
- 3
The divisors add up to 188356; without 90064 itself that is 98292, so 90064 is abundant (98292 is more than 90064). Euler's totient φ(90064) = 41472 numbers up to 90064 share no factor with it.
- 4
The digits of 90064 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 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90064 = 2^{4} \times 13 \times 433 \]90064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 188356 |
| Euler totient φ(n) | 41472 |
| Square | 8111524096 |
| Cube | 730556306182144 |
| Square root | 300.106648 (= 4√5629) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.0064 × |
90064 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand and sixty-four |
| Binary (base 2) | 10101111111010000 |
| Octal (base 8) | 257720 |
| Hexadecimal (base 16) | 15FD0 |
| Base 3 | 11120112201 |
| As time | 90064 seconds = 25 h 1 min 4 s |
Is 90064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90064 ÷ 2 = 45032) | 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 | Yes (90064 ÷ 4 = 22516) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (90064 ÷ 8 = 11258) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90064 a prime number?
No. 90064 = × 13 × 433, so it is divisible by 2.
What are the factors of 90064?
1, 2, 4, 8, 13, 16, 26, 52, 104, 208, 433, 866, 1732, 3464, 5629, 6928, 11258, 22516, 45032, 90064.
What is 90064 in binary?
10101111111010000 (hexadecimal 15FD0, octal 257720).
What is the square root of 90064?
About 300.1066, exactly 4√5629.
Is 90064 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 90064?
90064 is a happy number: repeatedly adding the squares of its digits reaches 1.