The number 55013
55013 is a composite number with 8 divisors. Its prime factorisation is 7 × 29 × 271. Divisors (8): 1, 7, 29, 203, 271, 1897, 7859, 55013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55013 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55013 is composite. Its prime factorisation is
- 3
The divisors add up to 65280; without 55013 itself that is 10267, so 55013 is deficient (10267 is less than 55013). Euler's totient φ(55013) = 45360 numbers up to 55013 share no factor with it.
- 4
The digits of 55013 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55013 = 7 \times 29 \times 271 \]
55013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65280 |
| Euler totient φ(n) | 45360 |
| Square | 3026430169 |
| Cube | 166493002887197 |
| Square root | 234.548502 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.5013 × |
55013 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and thirteen |
| Binary (base 2) | 1101011011100101 |
| Octal (base 8) | 153345 |
| Hexadecimal (base 16) | D6E5 |
| Base 3 | 2210110112 |
| As time | 55013 seconds = 15 h 16 min 53 s |
Is 55013 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 | Yes (55013 ÷ 7 = 7859) | 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 55013 a prime number?
No. 55013 = 7 × 29 × 271, so it is divisible by 7.
What are the factors of 55013?
1, 7, 29, 203, 271, 1897, 7859, 55013.
What is 55013 in binary?
1101011011100101 (hexadecimal D6E5, octal 153345).
What is the square root of 55013?
About 234.5485.
Is 55013 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 55013?
It is a composite number with 8 divisors.