The number 94874
94874 is a composite number with 16 divisors. Its prime factorisation is 2 × 13 × 41 × 89. Divisors (16): 1, 2, 13, 26, 41, 82, 89, 178, 533, 1066, 1157, 2314, 3649, 7298, 47437, 94874.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94874: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
94874 is composite. Its prime factorisation is
- 3
The divisors add up to 158760; without 94874 itself that is 63886, so 94874 is deficient (63886 is less than 94874). Euler's totient φ(94874) = 42240 numbers up to 94874 share no factor with it.
- 4
The digits of 94874 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94874 = 2 \times 13 \times 41 \times 89 \]
94874 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 158760 |
| Euler totient φ(n) | 42240 |
| Square | 9001075876 |
| Cube | 853968072659624 |
| Square root | 308.016233 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.4874 × |
94874 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand eight hundred and seventy-four |
| Binary (base 2) | 10111001010011010 |
| Octal (base 8) | 271232 |
| Hexadecimal (base 16) | 1729A |
| Base 3 | 11211010212 |
| As time | 94874 seconds = 26 h 21 min 14 s |
Is 94874 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94874 ÷ 2 = 47437) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94874 a prime number?
No. 94874 = 2 × 13 × 41 × 89, so it is divisible by 2.
What are the factors of 94874?
1, 2, 13, 26, 41, 82, 89, 178, 533, 1066, 1157, 2314, 3649, 7298, 47437, 94874.
What is 94874 in binary?
10111001010011010 (hexadecimal 1729A, octal 271232).
What is the square root of 94874?
About 308.0162.
Is 94874 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 94874?
94874 is a happy number: repeatedly adding the squares of its digits reaches 1.