The number 12051
12051 is a composite number with 12 divisors. Its prime factorisation is × 13 × 103. Divisors (12): 1, 3, 9, 13, 39, 103, 117, 309, 927, 1339, 4017, 12051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12051: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
12051 is composite. Its prime factorisation is
- 3
The divisors add up to 18928; without 12051 itself that is 6877, so 12051 is deficient (6877 is less than 12051). Euler's totient φ(12051) = 7344 numbers up to 12051 share no factor with it.
- 4
The digits of 12051 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 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12051 = 3^{2} \times 13 \times 103 \]12051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 18928 |
| Euler totient φ(n) | 7344 |
| Square | 145226601 |
| Cube | 1750125768651 |
| Square root | 109.777047 (= 3√1339) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.2051 × |
12051 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand and fifty-one |
| Binary (base 2) | 10111100010011 |
| Octal (base 8) | 27423 |
| Hexadecimal (base 16) | 2F13 |
| Base 3 | 121112100 |
| As time | 12051 seconds = 3 h 20 min 51 s |
Is 12051 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 (12051 ÷ 3 = 4017) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (12051 ÷ 9 = 1339) | 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 12051 a prime number?
No. 12051 = × 13 × 103, so it is divisible by 3.
What are the factors of 12051?
1, 3, 9, 13, 39, 103, 117, 309, 927, 1339, 4017, 12051.
What is 12051 in binary?
10111100010011 (hexadecimal 2F13, octal 27423).
What is the square root of 12051?
About 109.7770, exactly 3√1339.
Is 12051 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 12051?
12051 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.