The number 96447
96447 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 2473. Divisors (8): 1, 3, 13, 39, 2473, 7419, 32149, 96447.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96447 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96447 is composite. Its prime factorisation is
- 3
The divisors add up to 138544; without 96447 itself that is 42097, so 96447 is deficient (42097 is less than 96447). Euler's totient φ(96447) = 59328 numbers up to 96447 share no factor with it.
- 4
The digits of 96447 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96447 = 3 \times 13 \times 2473 \]
96447 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 138544 |
| Euler totient φ(n) | 59328 |
| Square | 9302023809 |
| Cube | 897152290306623 |
| Square root | 310.559173 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 128 |
| Scientific notation | 9.6447 × |
96447 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and forty-seven |
| Binary (base 2) | 10111100010111111 |
| Octal (base 8) | 274277 |
| Hexadecimal (base 16) | 178BF |
| Base 3 | 11220022010 |
| As time | 96447 seconds = 26 h 47 min 27 s |
Is 96447 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 (96447 ÷ 3 = 32149) | 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 2) | 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 | No (remainder 1) | 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 7) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96447 a prime number?
No. 96447 = 3 × 13 × 2473, so it is divisible by 3.
What are the factors of 96447?
1, 3, 13, 39, 2473, 7419, 32149, 96447.
What is 96447 in binary?
10111100010111111 (hexadecimal 178BF, octal 274277).
What is the square root of 96447?
About 310.5592.
Is 96447 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 96447?
It is a composite number with 8 divisors.