The number 55067
55067 is a composite number with 4 divisors. Its prime factorisation is 53 × 1039. Divisors (4): 1, 53, 1039, 55067.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55067: a semiprime: 53 × 1039, the product of two primes.
- 2
55067 is composite. Its prime factorisation is
- 3
The divisors add up to 56160; without 55067 itself that is 1093, so 55067 is deficient (1093 is less than 55067). Euler's totient φ(55067) = 53976 numbers up to 55067 share no factor with it.
- 4
The digits of 55067 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55067 = 53 \times 1039 \]
55067 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56160 |
| Euler totient φ(n) | 53976 |
| Square | 3032374489 |
| Cube | 166983765985763 |
| Square root | 234.663589 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.5067 × |
55067 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and sixty-seven |
| Binary (base 2) | 1101011100011011 |
| Octal (base 8) | 153433 |
| Hexadecimal (base 16) | D71B |
| Base 3 | 2210112112 |
| As time | 55067 seconds = 15 h 17 min 47 s |
Is 55067 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55067 a prime number?
No. 55067 = 53 × 1039, so it is divisible by 53.
What are the factors of 55067?
1, 53, 1039, 55067.
What is 55067 in binary?
1101011100011011 (hexadecimal D71B, octal 153433).
What is the square root of 55067?
About 234.6636.
Is 55067 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55067?
55067 is a semiprime: 53 × 1039, the product of two primes.