The number 59902
59902 is a composite number with 8 divisors. Its prime factorisation is 2 × 61 × 491. Divisors (8): 1, 2, 61, 122, 491, 982, 29951, 59902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59902 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59902 is composite. Its prime factorisation is
- 3
The divisors add up to 91512; without 59902 itself that is 31610, so 59902 is deficient (31610 is less than 59902). Euler's totient φ(59902) = 29400 numbers up to 59902 share no factor with it.
- 4
The digits of 59902 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 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59902 = 2 \times 61 \times 491 \]
59902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91512 |
| Euler totient φ(n) | 29400 |
| Square | 3588249604 |
| Cube | 214943327778808 |
| Square root | 244.748851 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.9902 × |
59902 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and two |
| Binary (base 2) | 1110100111111110 |
| Octal (base 8) | 164776 |
| Hexadecimal (base 16) | E9FE |
| Base 3 | 10001011121 |
| As time | 59902 seconds = 16 h 38 min 22 s |
Is 59902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59902 ÷ 2 = 29951) | 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 3) | 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 7) | 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 59902 a prime number?
No. 59902 = 2 × 61 × 491, so it is divisible by 2.
What are the factors of 59902?
1, 2, 61, 122, 491, 982, 29951, 59902.
What is 59902 in binary?
1110100111111110 (hexadecimal E9FE, octal 164776).
What is the square root of 59902?
About 244.7489.
Is 59902 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 59902?
It is a composite number with 8 divisors.