The number 55033
55033 is a composite number with 4 divisors. Its prime factorisation is 11 × 5003. Divisors (4): 1, 11, 5003, 55033.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55033: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 5003, the product of two primes.
- 2
55033 is composite. Its prime factorisation is
- 3
The divisors add up to 60048; without 55033 itself that is 5015, so 55033 is deficient (5015 is less than 55033). Euler's totient φ(55033) = 50020 numbers up to 55033 share no factor with it.
- 4
The digits of 55033 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55033 = 11 \times 5003 \]
55033 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60048 |
| Euler totient φ(n) | 50020 |
| Square | 3028631089 |
| Cube | 166674654720937 |
| Square root | 234.591134 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5033 × |
55033 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and thirty-three |
| Binary (base 2) | 1101011011111001 |
| Octal (base 8) | 153371 |
| Hexadecimal (base 16) | D6F9 |
| Base 3 | 2210111021 |
| As time | 55033 seconds = 15 h 17 min 13 s |
Is 55033 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 | No (remainder 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55033 ÷ 11 = 5003) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55033 a prime number?
No. 55033 = 11 × 5003, so it is divisible by 11.
What are the factors of 55033?
1, 11, 5003, 55033.
What is 55033 in binary?
1101011011111001 (hexadecimal D6F9, octal 153371).
What is the square root of 55033?
About 234.5911.
Is 55033 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 55033?
55033 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 5003, the product of two primes.