The number 60476
60476 is a composite number with 12 divisors. Its prime factorisation is × 13 × 1163. Divisors (12): 1, 2, 4, 13, 26, 52, 1163, 2326, 4652, 15119, 30238, 60476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60476 is composite. Its prime factorisation is
- 3
The divisors add up to 114072; without 60476 itself that is 53596, so 60476 is deficient (53596 is less than 60476). Euler's totient φ(60476) = 27888 numbers up to 60476 share no factor with it.
- 4
The digits of 60476 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60476 = 2^{2} \times 13 \times 1163 \]60476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 114072 |
| Euler totient φ(n) | 27888 |
| Square | 3657346576 |
| Cube | 221181691530176 |
| Square root | 245.918686 (= 2√15119) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 135 |
| Scientific notation | 6.0476 × |
60476 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand four hundred and seventy-six |
| Binary (base 2) | 1110110000111100 |
| Octal (base 8) | 166074 |
| Hexadecimal (base 16) | EC3C |
| Base 3 | 10001221212 |
| As time | 60476 seconds = 16 h 47 min 56 s |
Is 60476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60476 ÷ 2 = 30238) | 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 (60476 ÷ 4 = 15119) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 4) | 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 6) | 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 60476 a prime number?
No. 60476 = × 13 × 1163, so it is divisible by 2.
What are the factors of 60476?
1, 2, 4, 13, 26, 52, 1163, 2326, 4652, 15119, 30238, 60476.
What is 60476 in binary?
1110110000111100 (hexadecimal EC3C, octal 166074).
What is the square root of 60476?
About 245.9187, exactly 2√15119.
Is 60476 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 60476?
It is a composite number with 12 divisors.