The number 55902
55902 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 7 × . Divisors (32): 1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 121, 154, 231 … 55902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55902: a Harshad number: divisible by its digit sum 21.
- 2
55902 is composite. Its prime factorisation is
- 3
The divisors add up to 140544; without 55902 itself that is 84642, so 55902 is abundant (84642 is more than 55902). Euler's totient φ(55902) = 14520 numbers up to 55902 share no factor with it.
- 4
The digits of 55902 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55902 = 2 \times 3 \times 7 \times 11^{3} \]55902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 140544 |
| Euler totient φ(n) | 14520 |
| Square | 3125033604 |
| Cube | 174695628530808 |
| Square root | 236.436038 (= 11√462) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5902 × |
55902 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and two |
| Binary (base 2) | 1101101001011110 |
| Octal (base 8) | 155136 |
| Hexadecimal (base 16) | DA5E |
| Base 3 | 2211200110 |
| As time | 55902 seconds = 15 h 31 min 42 s |
Is 55902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55902 ÷ 2 = 27951) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55902 ÷ 3 = 18634) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (55902 ÷ 6 = 9317) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (55902 ÷ 7 = 7986) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55902 ÷ 11 = 5082) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55902 a prime number?
No. 55902 = 2 × 3 × 7 × , so it is divisible by 2.
What are the factors of 55902?
1, 2, 3, 6, 7, 11, 14, 21, 22, 33, 42, 66, 77, 121, 154, 231, 242, 363, 462, 726, 847, 1331, 1694, 2541, 2662, 3993, 5082, 7986, 9317, 18634, 27951, 55902.
What is 55902 in binary?
1101101001011110 (hexadecimal DA5E, octal 155136).
What is the square root of 55902?
About 236.4360, exactly 11√462.
Is 55902 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 55902?
55902 is a Harshad number: divisible by its digit sum 21.