The number 59970
59970 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1999. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1999, 3998, 5997, 9995, 11994, 19990, 29985, 59970.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59970: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 30.
- 2
59970 is composite. Its prime factorisation is
- 3
The divisors add up to 144000; without 59970 itself that is 84030, so 59970 is abundant (84030 is more than 59970). Euler's totient φ(59970) = 15984 numbers up to 59970 share no factor with it.
- 4
The digits of 59970 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59970 = 2 \times 3 \times 5 \times 1999 \]
59970 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 144000 |
| Euler totient φ(n) | 15984 |
| Square | 3596400900 |
| Cube | 215676161973000 |
| Square root | 244.887729 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.997 × |
59970 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and seventy |
| Binary (base 2) | 1110101001000010 |
| Octal (base 8) | 165102 |
| Hexadecimal (base 16) | EA42 |
| Base 3 | 10001021010 |
| As time | 59970 seconds = 16 h 39 min 30 s |
Is 59970 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59970 ÷ 2 = 29985) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (59970 ÷ 3 = 19990) | 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 | Yes (59970 ÷ 5 = 11994) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (59970 ÷ 6 = 9995) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59970 ÷ 10 = 5997) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59970 a prime number?
No. 59970 = 2 × 3 × 5 × 1999, so it is divisible by 2.
What are the factors of 59970?
1, 2, 3, 5, 6, 10, 15, 30, 1999, 3998, 5997, 9995, 11994, 19990, 29985, 59970.
What is 59970 in binary?
1110101001000010 (hexadecimal EA42, octal 165102).
What is the square root of 59970?
About 244.8877.
Is 59970 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 59970?
59970 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 30.