The number 2151
2151 is a composite number with 6 divisors. Its prime factorisation is × 239. Divisors (6): 1, 3, 9, 239, 717, 2151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2151: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
2151 is composite. Its prime factorisation is
- 3
The divisors add up to 3120; without 2151 itself that is 969, so 2151 is deficient (969 is less than 2151). Euler's totient φ(2151) = 1428 numbers up to 2151 share no factor with it.
- 4
The digits of 2151 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2151 = 3^{2} \times 239 \]2151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 3120 |
| Euler totient φ(n) | 1428 |
| Square | 4626801 |
| Cube | 9952248951 |
| Square root | 46.378875 (= 3√239) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 107 |
| Scientific notation | 2.151 × |
2151 in other forms
| Form | Value |
|---|---|
| In words | two thousand one hundred and fifty-one |
| Roman numerals | MMCLI |
| Binary (base 2) | 100001100111 |
| Octal (base 8) | 4147 |
| Hexadecimal (base 16) | 867 |
| Base 3 | 2221200 |
| As time | 2151 seconds = 35 min 51 s |
Is 2151 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 (2151 ÷ 3 = 717) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (2151 ÷ 9 = 239) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 2151 a prime number?
No. 2151 = × 239, so it is divisible by 3.
What are the factors of 2151?
1, 3, 9, 239, 717, 2151.
What is 2151 in binary?
100001100111 (hexadecimal 867, octal 4147).
What is the square root of 2151?
About 46.3789, exactly 3√239.
What is 2151 in Roman numerals?
MMCLI.
Is 2151 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 2151?
2151 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.