The number 10901
10901 is a palindrome: it reads 10901 backwards too. Its prime factorisation is 11 × 991. Divisors (4): 1, 11, 991, 10901.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10901: a palindrome: it reads 10901 backwards too; a Harshad number: divisible by its digit sum 11; a semiprime: 11 × 991, the product of two primes.
- 2
10901 is composite. Its prime factorisation is
- 3
The divisors add up to 11904; without 10901 itself that is 1003, so 10901 is deficient (1003 is less than 10901). Euler's totient φ(10901) = 9900 numbers up to 10901 share no factor with it.
- 4
The digits of 10901 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10901 = 11 \times 991 \]
10901 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11904 |
| Euler totient φ(n) | 9900 |
| Square | 118831801 |
| Cube | 1295385462701 |
| Square root | 104.407854 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.0901 × |
10901 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and one |
| Binary (base 2) | 10101010010101 |
| Octal (base 8) | 25225 |
| Hexadecimal (base 16) | 2A95 |
| Base 3 | 112221202 |
| As time | 10901 seconds = 3 h 1 min 41 s |
Is 10901 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 2) | 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 2) | 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 | Yes (10901 ÷ 11 = 991) | 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 10901 a prime number?
No. 10901 = 11 × 991, so it is divisible by 11.
What are the factors of 10901?
1, 11, 991, 10901.
What is 10901 in binary?
10101010010101 (hexadecimal 2A95, octal 25225).
What is the square root of 10901?
About 104.4079.
Is 10901 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 10901?
10901 is a palindrome: it reads 10901 backwards too; a Harshad number: divisible by its digit sum 11; a semiprime: 11 × 991, the product of two primes.