The number 10301
10301 is a palindromic prime: it reads the same backwards and is prime, a twin prime (10301 and 10303 are both prime) and the 1263rd prime number. Its only divisors are 1 and 10301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10301: a palindromic prime: it reads the same backwards and is prime; a twin prime (10301 and 10303 are both prime); the 1263rd prime number; a palindrome: it reads 10301 backwards too.
- 2
10301 is prime, so its only factors are 1 and 10301. It is the 1263rd prime; the next prime is 10303 and the one before is 10289.
- 3
The divisors add up to 10302; without 10301 itself that is 1, so 10301 is deficient (1 is less than 10301). Euler's totient φ(10301) = 10300 numbers up to 10301 share no factor with it.
- 4
The digits of 10301 add up to 5, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
10301 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 10302 |
| Euler totient φ(n) | 10300 |
| Square | 106110601 |
| Cube | 1093045300901 |
| Square root | 101.493842 |
| Digit sum / digital root | 5 / 5 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.0301 × |
10301 in other forms
| Form | Value |
|---|---|
| In words | ten thousand three hundred and one |
| Binary (base 2) | 10100000111101 |
| Octal (base 8) | 24075 |
| Hexadecimal (base 16) | 283D |
| Base 3 | 112010112 |
| As time | 10301 seconds = 2 h 51 min 41 s |
Is 10301 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 4) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 10301 a prime number?
Yes. 10301 is divisible only by 1 and itself.
What are the factors of 10301?
1, 10301.
What is 10301 in binary?
10100000111101 (hexadecimal 283D, octal 24075).
What is the square root of 10301?
About 101.4938.
Is 10301 divisible by 3?
No. Its digits add up to 5, which is not a multiple of 3.
What is special about the number 10301?
10301 is a palindromic prime: it reads the same backwards and is prime; a twin prime (10301 and 10303 are both prime); the 1263rd prime number; a palindrome: it reads 10301 backwards too.