The number 55465
55465 is a composite number with 4 divisors. Its prime factorisation is 5 × 11093. Divisors (4): 1, 5, 11093, 55465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55465: a semiprime: 5 × 11093, the product of two primes.
- 2
55465 is composite. Its prime factorisation is
- 3
The divisors add up to 66564; without 55465 itself that is 11099, so 55465 is deficient (11099 is less than 55465). Euler's totient φ(55465) = 44368 numbers up to 55465 share no factor with it.
- 4
The digits of 55465 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 228 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55465 = 5 \times 11093 \]
55465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66564 |
| Euler totient φ(n) | 44368 |
| Square | 3076366225 |
| Cube | 170630652669625 |
| Square root | 235.510085 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 228 |
| Scientific notation | 5.5465 × |
55465 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and sixty-five |
| Binary (base 2) | 1101100010101001 |
| Octal (base 8) | 154251 |
| Hexadecimal (base 16) | D8A9 |
| Base 3 | 2211002021 |
| As time | 55465 seconds = 15 h 24 min 25 s |
Is 55465 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 | Yes (55465 ÷ 5 = 11093) | 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 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 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 55465 a prime number?
No. 55465 = 5 × 11093, so it is divisible by 5.
What are the factors of 55465?
1, 5, 11093, 55465.
What is 55465 in binary?
1101100010101001 (hexadecimal D8A9, octal 154251).
What is the square root of 55465?
About 235.5101.
Is 55465 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55465?
55465 is a semiprime: 5 × 11093, the product of two primes.