The number 94059
94059 is a composite number with 12 divisors. Its prime factorisation is × 7 × 1493. Divisors (12): 1, 3, 7, 9, 21, 63, 1493, 4479, 10451, 13437, 31353, 94059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94059: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
94059 is composite. Its prime factorisation is
- 3
The divisors add up to 155376; without 94059 itself that is 61317, so 94059 is deficient (61317 is less than 94059). Euler's totient φ(94059) = 53712 numbers up to 94059 share no factor with it.
- 4
The digits of 94059 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 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94059 = 3^{2} \times 7 \times 1493 \]94059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 155376 |
| Euler totient φ(n) | 53712 |
| Square | 8847095481 |
| Cube | 832148953847379 |
| Square root | 306.690398 (= 3√10451) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.4059 × |
94059 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and fifty-nine |
| Binary (base 2) | 10110111101101011 |
| Octal (base 8) | 267553 |
| Hexadecimal (base 16) | 16F6B |
| Base 3 | 11210000200 |
| As time | 94059 seconds = 26 h 7 min 39 s |
Is 94059 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 (94059 ÷ 3 = 31353) | 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 | Yes (94059 ÷ 7 = 13437) | 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 | Yes (94059 ÷ 9 = 10451) | 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 9) | 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 94059 a prime number?
No. 94059 = × 7 × 1493, so it is divisible by 3.
What are the factors of 94059?
1, 3, 7, 9, 21, 63, 1493, 4479, 10451, 13437, 31353, 94059.
What is 94059 in binary?
10110111101101011 (hexadecimal 16F6B, octal 267553).
What is the square root of 94059?
About 306.6904, exactly 3√10451.
Is 94059 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 94059?
94059 is a happy number: repeatedly adding the squares of its digits reaches 1.