The number 33051
33051 is a composite number with 8 divisors. Its prime factorisation is 3 × 23 × 479. Divisors (8): 1, 3, 23, 69, 479, 1437, 11017, 33051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 33051: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
33051 is composite. Its prime factorisation is
- 3
The divisors add up to 46080; without 33051 itself that is 13029, so 33051 is deficient (13029 is less than 33051). Euler's totient φ(33051) = 21032 numbers up to 33051 share no factor with it.
- 4
The digits of 33051 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 160 steps to reach 1.
LaTeX source of the formulas on this page
\[ 33051 = 3 \times 23 \times 479 \]
33051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 46080 |
| Euler totient φ(n) | 21032 |
| Square | 1092368601 |
| Cube | 36103874631651 |
| Square root | 181.799340 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 160 |
| Scientific notation | 3.3051 × |
33051 in other forms
| Form | Value |
|---|---|
| In words | thirty-three thousand and fifty-one |
| Binary (base 2) | 1000000100011011 |
| Octal (base 8) | 100433 |
| Hexadecimal (base 16) | 811B |
| Base 3 | 1200100010 |
| As time | 33051 seconds = 9 h 10 min 51 s |
Is 33051 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 (33051 ÷ 3 = 11017) | 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 | 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 7) | 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 33051 a prime number?
No. 33051 = 3 × 23 × 479, so it is divisible by 3.
What are the factors of 33051?
1, 3, 23, 69, 479, 1437, 11017, 33051.
What is 33051 in binary?
1000000100011011 (hexadecimal 811B, octal 100433).
What is the square root of 33051?
About 181.7993.
Is 33051 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 33051?
33051 is a happy number: repeatedly adding the squares of its digits reaches 1.