The number 10601
10601 is a palindromic prime: it reads the same backwards and is prime, the 1293rd prime number and a palindrome: it reads 10601 backwards too. Its only divisors are 1 and 10601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10601: a palindromic prime: it reads the same backwards and is prime; the 1293rd prime number; a palindrome: it reads 10601 backwards too.
- 2
10601 is prime, so its only factors are 1 and 10601. It is the 1293rd prime; the next prime is 10607 and the one before is 10597.
- 3
The divisors add up to 10602; without 10601 itself that is 1, so 10601 is deficient (1 is less than 10601). Euler's totient φ(10601) = 10600 numbers up to 10601 share no factor with it.
- 4
The digits of 10601 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
10601 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 10602 |
| Euler totient φ(n) | 10600 |
| Square | 112381201 |
| Cube | 1191353111801 |
| Square root | 102.961158 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.0601 × |
10601 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and one |
| Binary (base 2) | 10100101101001 |
| Octal (base 8) | 24551 |
| Hexadecimal (base 16) | 2969 |
| Base 3 | 112112122 |
| As time | 10601 seconds = 2 h 56 min 41 s |
Is 10601 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | 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 5) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10601 a prime number?
Yes. 10601 is divisible only by 1 and itself.
What are the factors of 10601?
1, 10601.
What is 10601 in binary?
10100101101001 (hexadecimal 2969, octal 24551).
What is the square root of 10601?
About 102.9612.
Is 10601 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 10601?
10601 is a palindromic prime: it reads the same backwards and is prime; the 1293rd prime number; a palindrome: it reads 10601 backwards too.