The number 5902
5902 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 227. Divisors (8): 1, 2, 13, 26, 227, 454, 2951, 5902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5902 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5902 is composite. Its prime factorisation is
- 3
The divisors add up to 9576; without 5902 itself that is 3674, so 5902 is deficient (3674 is less than 5902). Euler's totient φ(5902) = 2712 numbers up to 5902 share no factor with it.
- 4
The digits of 5902 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5902 = 2 \times 13 \times 227 \]
5902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 9576 |
| Euler totient φ(n) | 2712 |
| Square | 34833604 |
| Cube | 205587930808 |
| Square root | 76.824475 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 98 |
| Scientific notation | 5.902 × |
5902 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and two |
| Binary (base 2) | 1011100001110 |
| Octal (base 8) | 13416 |
| Hexadecimal (base 16) | 170E |
| Base 3 | 22002121 |
| As time | 5902 seconds = 1 h 38 min 22 s |
Is 5902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5902 ÷ 2 = 2951) | 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 1) | 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 7) | 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 6) | 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 5902 a prime number?
No. 5902 = 2 × 13 × 227, so it is divisible by 2.
What are the factors of 5902?
1, 2, 13, 26, 227, 454, 2951, 5902.
What is 5902 in binary?
1011100001110 (hexadecimal 170E, octal 13416).
What is the square root of 5902?
About 76.8245.
Is 5902 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 5902?
It is a composite number with 8 divisors.