The number 55367
55367 is a composite number with 4 divisors. Its prime factorisation is 13 × 4259. Divisors (4): 1, 13, 4259, 55367.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55367: a semiprime: 13 × 4259, the product of two primes.
- 2
55367 is composite. Its prime factorisation is
- 3
The divisors add up to 59640; without 55367 itself that is 4273, so 55367 is deficient (4273 is less than 55367). Euler's totient φ(55367) = 51096 numbers up to 55367 share no factor with it.
- 4
The digits of 55367 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 215 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55367 = 13 \times 4259 \]
55367 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59640 |
| Euler totient φ(n) | 51096 |
| Square | 3065504689 |
| Cube | 169727798115863 |
| Square root | 235.301934 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 215 |
| Scientific notation | 5.5367 × |
55367 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand three hundred and sixty-seven |
| Binary (base 2) | 1101100001000111 |
| Octal (base 8) | 154107 |
| Hexadecimal (base 16) | D847 |
| Base 3 | 2210221122 |
| As time | 55367 seconds = 15 h 22 min 47 s |
Is 55367 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 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 7) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 55367 a prime number?
No. 55367 = 13 × 4259, so it is divisible by 13.
What are the factors of 55367?
1, 13, 4259, 55367.
What is 55367 in binary?
1101100001000111 (hexadecimal D847, octal 154107).
What is the square root of 55367?
About 235.3019.
Is 55367 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 55367?
55367 is a semiprime: 13 × 4259, the product of two primes.