The number 53690
53690 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 7 × 13 × 59. Divisors (32): 1, 2, 5, 7, 10, 13, 14, 26, 35, 59, 65, 70, 91, 118, 130, 182 … 53690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53690 is composite. Its prime factorisation is
- 3
The divisors add up to 120960; without 53690 itself that is 67270, so 53690 is abundant (67270 is more than 53690). Euler's totient φ(53690) = 16704 numbers up to 53690 share no factor with it.
- 4
The digits of 53690 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53690 = 2 \times 5 \times 7 \times 13 \times 59 \]
53690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 120960 |
| Euler totient φ(n) | 16704 |
| Square | 2882616100 |
| Cube | 154767658409000 |
| Square root | 231.711027 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.369 × |
53690 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand six hundred and ninety |
| Binary (base 2) | 1101000110111010 |
| Octal (base 8) | 150672 |
| Hexadecimal (base 16) | D1BA |
| Base 3 | 2201122112 |
| As time | 53690 seconds = 14 h 54 min 50 s |
Is 53690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53690 ÷ 2 = 26845) | 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 (53690 ÷ 5 = 10738) | 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 | Yes (53690 ÷ 7 = 7670) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (53690 ÷ 10 = 5369) | 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 53690 a prime number?
No. 53690 = 2 × 5 × 7 × 13 × 59, so it is divisible by 2.
What are the factors of 53690?
1, 2, 5, 7, 10, 13, 14, 26, 35, 59, 65, 70, 91, 118, 130, 182, 295, 413, 455, 590, 767, 826, 910, 1534, 2065, 3835, 4130, 5369, 7670, 10738, 26845, 53690.
What is 53690 in binary?
1101000110111010 (hexadecimal D1BA, octal 150672).
What is the square root of 53690?
About 231.7110.
Is 53690 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 53690?
It is a composite number with 32 divisors.