The number 20151
20151 is a composite number with 6 divisors. Its prime factorisation is × 2239. Divisors (6): 1, 3, 9, 2239, 6717, 20151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20151: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
20151 is composite. Its prime factorisation is
- 3
The divisors add up to 29120; without 20151 itself that is 8969, so 20151 is deficient (8969 is less than 20151). Euler's totient φ(20151) = 13428 numbers up to 20151 share no factor with it.
- 4
The digits of 20151 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 92 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20151 = 3^{2} \times 2239 \]20151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 29120 |
| Euler totient φ(n) | 13428 |
| Square | 406062801 |
| Cube | 8182571502951 |
| Square root | 141.954218 (= 3√2239) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 92 |
| Scientific notation | 2.0151 × |
20151 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and fifty-one |
| Binary (base 2) | 100111010110111 |
| Octal (base 8) | 47267 |
| Hexadecimal (base 16) | 4EB7 |
| Base 3 | 1000122100 |
| As time | 20151 seconds = 5 h 35 min 51 s |
Is 20151 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 (20151 ÷ 3 = 6717) | 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 5) | 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 (20151 ÷ 9 = 2239) | 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 10) | 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 20151 a prime number?
No. 20151 = × 2239, so it is divisible by 3.
What are the factors of 20151?
1, 3, 9, 2239, 6717, 20151.
What is 20151 in binary?
100111010110111 (hexadecimal 4EB7, octal 47267).
What is the square root of 20151?
About 141.9542, exactly 3√2239.
Is 20151 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 20151?
20151 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.