The number 9495
9495 is a composite number with 12 divisors. Its prime factorisation is × 5 × 211. Divisors (12): 1, 3, 5, 9, 15, 45, 211, 633, 1055, 1899, 3165, 9495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9495: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
9495 is composite. Its prime factorisation is
- 3
The divisors add up to 16536; without 9495 itself that is 7041, so 9495 is deficient (7041 is less than 9495). Euler's totient φ(9495) = 5040 numbers up to 9495 share no factor with it.
- 4
The digits of 9495 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9495 = 3^{2} \times 5 \times 211 \]9495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 16536 |
| Euler totient φ(n) | 5040 |
| Square | 90155025 |
| Cube | 856021962375 |
| Square root | 97.442291 (= 3√1055) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 153 |
| Scientific notation | 9.495 × |
9495 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and ninety-five |
| Binary (base 2) | 10010100010111 |
| Octal (base 8) | 22427 |
| Hexadecimal (base 16) | 2517 |
| Base 3 | 111000200 |
| As time | 9495 seconds = 2 h 38 min 15 s |
Is 9495 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 (9495 ÷ 3 = 3165) | 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 | Yes (9495 ÷ 5 = 1899) | 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 3) | 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 | Yes (9495 ÷ 9 = 1055) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 9495 a prime number?
No. 9495 = × 5 × 211, so it is divisible by 3.
What are the factors of 9495?
1, 3, 5, 9, 15, 45, 211, 633, 1055, 1899, 3165, 9495.
What is 9495 in binary?
10010100010111 (hexadecimal 2517, octal 22427).
What is the square root of 9495?
About 97.4423, exactly 3√1055.
Is 9495 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 9495?
9495 is a happy number: repeatedly adding the squares of its digits reaches 1.