The number 59948
59948 is a composite number with 12 divisors. Its prime factorisation is × 7 × 2141. Divisors (12): 1, 2, 4, 7, 14, 28, 2141, 4282, 8564, 14987, 29974, 59948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59948 is composite. Its prime factorisation is
- 3
The divisors add up to 119952; without 59948 itself that is 60004, so 59948 is abundant (60004 is more than 59948). Euler's totient φ(59948) = 25680 numbers up to 59948 share no factor with it.
- 4
The digits of 59948 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59948 = 2^{2} \times 7 \times 2141 \]59948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 119952 |
| Euler totient φ(n) | 25680 |
| Square | 3593762704 |
| Cube | 215438886579392 |
| Square root | 244.842807 (= 2√14987) |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.9948 × |
59948 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and forty-eight |
| Binary (base 2) | 1110101000101100 |
| Octal (base 8) | 165054 |
| Hexadecimal (base 16) | EA2C |
| Base 3 | 10001020022 |
| As time | 59948 seconds = 16 h 39 min 8 s |
Is 59948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59948 ÷ 2 = 29974) | 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 (59948 ÷ 4 = 14987) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 | Yes (59948 ÷ 7 = 8564) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59948 a prime number?
No. 59948 = × 7 × 2141, so it is divisible by 2.
What are the factors of 59948?
1, 2, 4, 7, 14, 28, 2141, 4282, 8564, 14987, 29974, 59948.
What is 59948 in binary?
1110101000101100 (hexadecimal EA2C, octal 165054).
What is the square root of 59948?
About 244.8428, exactly 2√14987.
Is 59948 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 59948?
It is a composite number with 12 divisors.