The number 60364
60364 is a composite number with 6 divisors. Its prime factorisation is × 15091. Divisors (6): 1, 2, 4, 15091, 30182, 60364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60364: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
60364 is composite. Its prime factorisation is
- 3
The divisors add up to 105644; without 60364 itself that is 45280, so 60364 is deficient (45280 is less than 60364). Euler's totient φ(60364) = 30180 numbers up to 60364 share no factor with it.
- 4
The digits of 60364 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60364 = 2^{2} \times 15091 \]60364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 105644 |
| Euler totient φ(n) | 30180 |
| Square | 3643812496 |
| Cube | 219955097508544 |
| Square root | 245.690863 (= 2√15091) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 73 |
| Scientific notation | 6.0364 × |
60364 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand three hundred and sixty-four |
| Binary (base 2) | 1110101111001100 |
| Octal (base 8) | 165714 |
| Hexadecimal (base 16) | EBCC |
| Base 3 | 10001210201 |
| As time | 60364 seconds = 16 h 46 min 4 s |
Is 60364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60364 ÷ 2 = 30182) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (60364 ÷ 4 = 15091) | 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 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60364 a prime number?
No. 60364 = × 15091, so it is divisible by 2.
What are the factors of 60364?
1, 2, 4, 15091, 30182, 60364.
What is 60364 in binary?
1110101111001100 (hexadecimal EBCC, octal 165714).
What is the square root of 60364?
About 245.6909, exactly 2√15091.
Is 60364 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 60364?
60364 is a happy number: repeatedly adding the squares of its digits reaches 1.