The number 99064
99064 is a composite number with 32 divisors. Its prime factorisation is × 7 × 29 × 61. Divisors (32): 1, 2, 4, 7, 8, 14, 28, 29, 56, 58, 61, 116, 122, 203, 232, 244 … 99064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 99064: a Harshad number: divisible by its digit sum 28.
- 2
99064 is composite. Its prime factorisation is
- 3
The divisors add up to 223200; without 99064 itself that is 124136, so 99064 is abundant (124136 is more than 99064). Euler's totient φ(99064) = 40320 numbers up to 99064 share no factor with it.
- 4
The digits of 99064 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 172 steps to reach 1.
LaTeX source of the formulas on this page
\[ 99064 = 2^{3} \times 7 \times 29 \times 61 \]99064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 223200 |
| Euler totient φ(n) | 40320 |
| Square | 9813676096 |
| Cube | 972182008774144 |
| Square root | 314.744341 (= 2√24766) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 172 |
| Scientific notation | 9.9064 × |
99064 in other forms
| Form | Value |
|---|---|
| In words | ninety-nine thousand and sixty-four |
| Binary (base 2) | 11000001011111000 |
| Octal (base 8) | 301370 |
| Hexadecimal (base 16) | 182F8 |
| Base 3 | 12000220001 |
| As time | 99064 seconds = 27 h 31 min 4 s |
Is 99064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (99064 ÷ 2 = 49532) | 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 (99064 ÷ 4 = 24766) | 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 | Yes (99064 ÷ 7 = 14152) | 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 (99064 ÷ 8 = 12383) | 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 9) | 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 99064 a prime number?
No. 99064 = × 7 × 29 × 61, so it is divisible by 2.
What are the factors of 99064?
1, 2, 4, 7, 8, 14, 28, 29, 56, 58, 61, 116, 122, 203, 232, 244, 406, 427, 488, 812, 854, 1624, 1708, 1769, 3416, 3538, 7076, 12383, 14152, 24766, 49532, 99064.
What is 99064 in binary?
11000001011111000 (hexadecimal 182F8, octal 301370).
What is the square root of 99064?
About 314.7443, exactly 2√24766.
Is 99064 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 99064?
99064 is a Harshad number: divisible by its digit sum 28.