The number 59690
59690 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 47 × 127. Divisors (16): 1, 2, 5, 10, 47, 94, 127, 235, 254, 470, 635, 1270, 5969, 11938, 29845, 59690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59690 is composite. Its prime factorisation is
- 3
The divisors add up to 110592; without 59690 itself that is 50902, so 59690 is deficient (50902 is less than 59690). Euler's totient φ(59690) = 23184 numbers up to 59690 share no factor with it.
- 4
The digits of 59690 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59690 = 2 \times 5 \times 47 \times 127 \]
59690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 110592 |
| Euler totient φ(n) | 23184 |
| Square | 3562896100 |
| Cube | 212669268209000 |
| Square root | 244.315370 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.969 × |
59690 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand six hundred and ninety |
| Binary (base 2) | 1110100100101010 |
| Octal (base 8) | 164452 |
| Hexadecimal (base 16) | E92A |
| Base 3 | 10000212202 |
| As time | 59690 seconds = 16 h 34 min 50 s |
Is 59690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59690 ÷ 2 = 29845) | 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 | Yes (59690 ÷ 5 = 11938) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59690 ÷ 10 = 5969) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 59690 a prime number?
No. 59690 = 2 × 5 × 47 × 127, so it is divisible by 2.
What are the factors of 59690?
1, 2, 5, 10, 47, 94, 127, 235, 254, 470, 635, 1270, 5969, 11938, 29845, 59690.
What is 59690 in binary?
1110100100101010 (hexadecimal E92A, octal 164452).
What is the square root of 59690?
About 244.3154.
Is 59690 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 59690?
It is a composite number with 16 divisors.