The number 9159
9159 is a composite number with 8 divisors. Its prime factorisation is 3 × 43 × 71. Divisors (8): 1, 3, 43, 71, 129, 213, 3053, 9159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9159: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
9159 is composite. Its prime factorisation is
- 3
The divisors add up to 12672; without 9159 itself that is 3513, so 9159 is deficient (3513 is less than 9159). Euler's totient φ(9159) = 5880 numbers up to 9159 share no factor with it.
- 4
The digits of 9159 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9159 = 3 \times 43 \times 71 \]
9159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 12672 |
| Euler totient φ(n) | 5880 |
| Square | 83887281 |
| Cube | 768323606679 |
| Square root | 95.702665 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 197 |
| Scientific notation | 9.159 × |
9159 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and fifty-nine |
| Binary (base 2) | 10001111000111 |
| Octal (base 8) | 21707 |
| Hexadecimal (base 16) | 23C7 |
| Base 3 | 110120020 |
| As time | 9159 seconds = 2 h 32 min 39 s |
Is 9159 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 (9159 ÷ 3 = 3053) | 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 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 | No (remainder 6) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9159 a prime number?
No. 9159 = 3 × 43 × 71, so it is divisible by 3.
What are the factors of 9159?
1, 3, 43, 71, 129, 213, 3053, 9159.
What is 9159 in binary?
10001111000111 (hexadecimal 23C7, octal 21707).
What is the square root of 9159?
About 95.7027.
Is 9159 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 9159?
9159 is a happy number: repeatedly adding the squares of its digits reaches 1.