The number 55393
55393 is a composite number with 4 divisors. Its prime factorisation is 13 × 4261. Divisors (4): 1, 13, 4261, 55393.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55393: a semiprime: 13 × 4261, the product of two primes.
- 2
55393 is composite. Its prime factorisation is
- 3
The divisors add up to 59668; without 55393 itself that is 4275, so 55393 is deficient (4275 is less than 55393). Euler's totient φ(55393) = 51120 numbers up to 55393 share no factor with it.
- 4
The digits of 55393 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55393 = 13 \times 4261 \]
55393 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59668 |
| Euler totient φ(n) | 51120 |
| Square | 3068384449 |
| Cube | 169967019783457 |
| Square root | 235.357175 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5393 × |
55393 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand three hundred and ninety-three |
| Binary (base 2) | 1101100001100001 |
| Octal (base 8) | 154141 |
| Hexadecimal (base 16) | D861 |
| Base 3 | 2210222121 |
| As time | 55393 seconds = 15 h 23 min 13 s |
Is 55393 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 2) | 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 | No (remainder 8) | 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 55393 a prime number?
No. 55393 = 13 × 4261, so it is divisible by 13.
What are the factors of 55393?
1, 13, 4261, 55393.
What is 55393 in binary?
1101100001100001 (hexadecimal D861, octal 154141).
What is the square root of 55393?
About 235.3572.
Is 55393 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55393?
55393 is a semiprime: 13 × 4261, the product of two primes.