The number 96499
96499 is a composite number with 6 divisors. Its prime factorisation is Ć 571. Divisors (6): 1, 13, 169, 571, 7423, 96499.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96499 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96499 is composite. Its prime factorisation is
- 3
The divisors add up to 104676; without 96499 itself that is 8177, so 96499 is deficient (8177 is less than 96499). Euler's totient Ļ(96499) = 88920 numbers up to 96499 share no factor with it.
- 4
The digits of 96499 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96499 = 13^{2} \times 571 \]96499 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 104676 |
| Euler totient Ļ(n) | 88920 |
| Square | 9312057001 |
| Cube | 898604188539499 |
| Square root | 310.642882 (= 13ā571) |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.6499 Ć |
96499 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and ninety-nine |
| Binary (base 2) | 10111100011110011 |
| Octal (base 8) | 274363 |
| Hexadecimal (base 16) | 178F3 |
| Base 3 | 11220101001 |
| As time | 96499 seconds = 26 h 48 min 19 s |
Is 96499 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 | No (remainder 1) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | 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 9) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96499 a prime number?
No. 96499 = Ć 571, so it is divisible by 13.
What are the factors of 96499?
1, 13, 169, 571, 7423, 96499.
What is 96499 in binary?
10111100011110011 (hexadecimal 178F3, octal 274363).
What is the square root of 96499?
About 310.6429, exactly 13ā571.
Is 96499 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 96499?
It is a composite number with 6 divisors.