The number 99460
99460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 4973. Divisors (12): 1, 2, 4, 5, 10, 20, 4973, 9946, 19892, 24865, 49730, 99460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
99460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
99460 is composite. Its prime factorisation is
- 3
The divisors add up to 208908; without 99460 itself that is 109448, so 99460 is abundant (109448 is more than 99460). Euler's totient φ(99460) = 39776 numbers up to 99460 share no factor with it.
- 4
The digits of 99460 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 99460 = 2^{2} \times 5 \times 4973 \]99460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 208908 |
| Euler totient φ(n) | 39776 |
| Square | 9892291600 |
| Cube | 983887322536000 |
| Square root | 315.372795 (= 2√24865) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.946 × |
99460 in other forms
| Form | Value |
|---|---|
| In words | ninety-nine thousand four hundred and sixty |
| Binary (base 2) | 11000010010000100 |
| Octal (base 8) | 302204 |
| Hexadecimal (base 16) | 18484 |
| Base 3 | 12001102201 |
| As time | 99460 seconds = 27 h 37 min 40 s |
Is 99460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (99460 ÷ 2 = 49730) | 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 (99460 ÷ 4 = 24865) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (99460 ÷ 5 = 19892) | 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 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 4) | 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 | Yes (99460 ÷ 10 = 9946) | 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 99460 a prime number?
No. 99460 = × 5 × 4973, so it is divisible by 2.
What are the factors of 99460?
1, 2, 4, 5, 10, 20, 4973, 9946, 19892, 24865, 49730, 99460.
What is 99460 in binary?
11000010010000100 (hexadecimal 18484, octal 302204).
What is the square root of 99460?
About 315.3728, exactly 2√24865.
Is 99460 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 99460?
It is a composite number with 12 divisors.