The number 59102
59102 is a composite number with 8 divisors. Its prime factorisation is 2 × 29 × 1019. Divisors (8): 1, 2, 29, 58, 1019, 2038, 29551, 59102.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59102 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59102 is composite. Its prime factorisation is
- 3
The divisors add up to 91800; without 59102 itself that is 32698, so 59102 is deficient (32698 is less than 59102). Euler's totient φ(59102) = 28504 numbers up to 59102 share no factor with it.
- 4
The digits of 59102 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59102 = 2 \times 29 \times 1019 \]
59102 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 91800 |
| Euler totient φ(n) | 28504 |
| Square | 3493046404 |
| Cube | 206446028569208 |
| Square root | 243.109029 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.9102 × |
59102 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and two |
| Binary (base 2) | 1110011011011110 |
| Octal (base 8) | 163336 |
| Hexadecimal (base 16) | E6DE |
| Base 3 | 10000001222 |
| As time | 59102 seconds = 16 h 25 min 2 s |
Is 59102 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59102 ÷ 2 = 29551) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 2) | 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 8) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59102 a prime number?
No. 59102 = 2 × 29 × 1019, so it is divisible by 2.
What are the factors of 59102?
1, 2, 29, 58, 1019, 2038, 29551, 59102.
What is 59102 in binary?
1110011011011110 (hexadecimal E6DE, octal 163336).
What is the square root of 59102?
About 243.1090.
Is 59102 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 59102?
It is a composite number with 8 divisors.