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