The number 94952
94952 is a composite number with 32 divisors. Its prime factorisation is × 11 × 13 × 83. Divisors (32): 1, 2, 4, 8, 11, 13, 22, 26, 44, 52, 83, 88, 104, 143, 166, 286 … 94952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94952 is composite. Its prime factorisation is
- 3
The divisors add up to 211680; without 94952 itself that is 116728, so 94952 is abundant (116728 is more than 94952). Euler's totient φ(94952) = 39360 numbers up to 94952 share no factor with it.
- 4
The digits of 94952 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94952 = 2^{3} \times 11 \times 13 \times 83 \]94952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 211680 |
| Euler totient φ(n) | 39360 |
| Square | 9015882304 |
| Cube | 856076056529408 |
| Square root | 308.142824 (= 2√23738) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.4952 × |
94952 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand nine hundred and fifty-two |
| Binary (base 2) | 10111001011101000 |
| Octal (base 8) | 271350 |
| Hexadecimal (base 16) | 172E8 |
| Base 3 | 11211020202 |
| As time | 94952 seconds = 26 h 22 min 32 s |
Is 94952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94952 ÷ 2 = 47476) | 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 | Yes (94952 ÷ 4 = 23738) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 4) | 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 | Yes (94952 ÷ 8 = 11869) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (94952 ÷ 11 = 8632) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94952 a prime number?
No. 94952 = × 11 × 13 × 83, so it is divisible by 2.
What are the factors of 94952?
1, 2, 4, 8, 11, 13, 22, 26, 44, 52, 83, 88, 104, 143, 166, 286, 332, 572, 664, 913, 1079, 1144, 1826, 2158, 3652, 4316, 7304, 8632, 11869, 23738, 47476, 94952.
What is 94952 in binary?
10111001011101000 (hexadecimal 172E8, octal 271350).
What is the square root of 94952?
About 308.1428, exactly 2√23738.
Is 94952 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 94952?
It is a composite number with 32 divisors.