The number 56902
56902 is a composite number with 8 divisors. Its prime factorisation is 2 × 23 × 1237. Divisors (8): 1, 2, 23, 46, 1237, 2474, 28451, 56902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56902 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56902 is composite. Its prime factorisation is
- 3
The divisors add up to 89136; without 56902 itself that is 32234, so 56902 is deficient (32234 is less than 56902). Euler's totient φ(56902) = 27192 numbers up to 56902 share no factor with it.
- 4
The digits of 56902 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56902 = 2 \times 23 \times 1237 \]
56902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 89136 |
| Euler totient φ(n) | 27192 |
| Square | 3237837604 |
| Cube | 184239435342808 |
| Square root | 238.541401 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.6902 × |
56902 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and two |
| Binary (base 2) | 1101111001000110 |
| Octal (base 8) | 157106 |
| Hexadecimal (base 16) | DE46 |
| Base 3 | 2220001111 |
| As time | 56902 seconds = 15 h 48 min 22 s |
Is 56902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56902 ÷ 2 = 28451) | 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 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 4) | 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 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56902 a prime number?
No. 56902 = 2 × 23 × 1237, so it is divisible by 2.
What are the factors of 56902?
1, 2, 23, 46, 1237, 2474, 28451, 56902.
What is 56902 in binary?
1101111001000110 (hexadecimal DE46, octal 157106).
What is the square root of 56902?
About 238.5414.
Is 56902 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 56902?
It is a composite number with 8 divisors.