The number 2901
2901 is a composite number with 4 divisors. Its prime factorisation is 3 × 967. Divisors (4): 1, 3, 967, 2901.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2901: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 967, the product of two primes.
- 2
2901 is composite. Its prime factorisation is
- 3
The divisors add up to 3872; without 2901 itself that is 971, so 2901 is deficient (971 is less than 2901). Euler's totient φ(2901) = 1932 numbers up to 2901 share no factor with it.
- 4
The digits of 2901 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 22 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2901 = 3 \times 967 \]
2901 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 3872 |
| Euler totient φ(n) | 1932 |
| Square | 8415801 |
| Cube | 24414238701 |
| Square root | 53.860932 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 22 |
| Scientific notation | 2.901 × |
2901 in other forms
| Form | Value |
|---|---|
| In words | two thousand nine hundred and one |
| Roman numerals | MMCMI |
| Binary (base 2) | 101101010101 |
| Octal (base 8) | 5525 |
| Hexadecimal (base 16) | B55 |
| Base 3 | 10222110 |
| As time | 2901 seconds = 48 min 21 s |
Is 2901 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 | Yes (2901 ÷ 3 = 967) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 2901 a prime number?
No. 2901 = 3 × 967, so it is divisible by 3.
What are the factors of 2901?
1, 3, 967, 2901.
What is 2901 in binary?
101101010101 (hexadecimal B55, octal 5525).
What is the square root of 2901?
About 53.8609.
What is 2901 in Roman numerals?
MMCMI.
Is 2901 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 2901?
2901 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 967, the product of two primes.