The number 60506
60506 is a palindrome: it reads 60506 backwards too. Its prime factorisation is 2 × 30253. Divisors (4): 1, 2, 30253, 60506.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60506: a palindrome: it reads 60506 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 30253, the product of two primes.
- 2
60506 is composite. Its prime factorisation is
- 3
The divisors add up to 90762; without 60506 itself that is 30256, so 60506 is deficient (30256 is less than 60506). Euler's totient φ(60506) = 30252 numbers up to 60506 share no factor with it.
- 4
The digits of 60506 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60506 = 2 \times 30253 \]
60506 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 90762 |
| Euler totient φ(n) | 30252 |
| Square | 3660976036 |
| Cube | 221511016034216 |
| Square root | 245.979674 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.0506 × |
60506 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand five hundred and six |
| Binary (base 2) | 1110110001011010 |
| Octal (base 8) | 166132 |
| Hexadecimal (base 16) | EC5A |
| Base 3 | 10001222222 |
| As time | 60506 seconds = 16 h 48 min 26 s |
Is 60506 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60506 ÷ 2 = 30253) | 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 | No (remainder 2) | 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 5) | 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 8) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60506 a prime number?
No. 60506 = 2 × 30253, so it is divisible by 2.
What are the factors of 60506?
1, 2, 30253, 60506.
What is 60506 in binary?
1110110001011010 (hexadecimal EC5A, octal 166132).
What is the square root of 60506?
About 245.9797.
Is 60506 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 60506?
60506 is a palindrome: it reads 60506 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 30253, the product of two primes.