The number 90159
90159 is a composite number with 8 divisors. Its prime factorisation is 3 × 41 × 733. Divisors (8): 1, 3, 41, 123, 733, 2199, 30053, 90159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90159: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
90159 is composite. Its prime factorisation is
- 3
The divisors add up to 123312; without 90159 itself that is 33153, so 90159 is deficient (33153 is less than 90159). Euler's totient φ(90159) = 58560 numbers up to 90159 share no factor with it.
- 4
The digits of 90159 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 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90159 = 3 \times 41 \times 733 \]
90159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 123312 |
| Euler totient φ(n) | 58560 |
| Square | 8128645281 |
| Cube | 732870529889679 |
| Square root | 300.264883 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 208 |
| Scientific notation | 9.0159 × |
90159 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand one hundred and fifty-nine |
| Binary (base 2) | 10110000000101111 |
| Octal (base 8) | 260057 |
| Hexadecimal (base 16) | 1602F |
| Base 3 | 11120200020 |
| As time | 90159 seconds = 25 h 2 min 39 s |
Is 90159 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 (90159 ÷ 3 = 30053) | 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 6) | 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 3) | 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 90159 a prime number?
No. 90159 = 3 × 41 × 733, so it is divisible by 3.
What are the factors of 90159?
1, 3, 41, 123, 733, 2199, 30053, 90159.
What is 90159 in binary?
10110000000101111 (hexadecimal 1602F, octal 260057).
What is the square root of 90159?
About 300.2649.
Is 90159 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 90159?
90159 is a happy number: repeatedly adding the squares of its digits reaches 1.