The number 55435
55435 is a composite number with 4 divisors. Its prime factorisation is 5 × 11087. Divisors (4): 1, 5, 11087, 55435.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55435: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 11087, the product of two primes.
- 2
55435 is composite. Its prime factorisation is
- 3
The divisors add up to 66528; without 55435 itself that is 11093, so 55435 is deficient (11093 is less than 55435). Euler's totient φ(55435) = 44344 numbers up to 55435 share no factor with it.
- 4
The digits of 55435 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55435 = 5 \times 11087 \]
55435 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 66528 |
| Euler totient φ(n) | 44344 |
| Square | 3073039225 |
| Cube | 170353929437875 |
| Square root | 235.446385 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5435 × |
55435 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and thirty-five |
| Binary (base 2) | 1101100010001011 |
| Octal (base 8) | 154213 |
| Hexadecimal (base 16) | D88B |
| Base 3 | 2211001011 |
| As time | 55435 seconds = 15 h 23 min 55 s |
Is 55435 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (55435 ÷ 5 = 11087) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55435 a prime number?
No. 55435 = 5 × 11087, so it is divisible by 5.
What are the factors of 55435?
1, 5, 11087, 55435.
What is 55435 in binary?
1101100010001011 (hexadecimal D88B, octal 154213).
What is the square root of 55435?
About 235.4464.
Is 55435 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 55435?
55435 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 11087, the product of two primes.