The number 5290
5290 is a composite number with 12 divisors. Its prime factorisation is 2 × 5 × . Divisors (12): 1, 2, 5, 10, 23, 46, 115, 230, 529, 1058, 2645, 5290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5290 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5290 is composite. Its prime factorisation is
- 3
The divisors add up to 9954; without 5290 itself that is 4664, so 5290 is deficient (4664 is less than 5290). Euler's totient φ(5290) = 2024 numbers up to 5290 share no factor with it.
- 4
The digits of 5290 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 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5290 = 2 \times 5 \times 23^{2} \]5290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 9954 |
| Euler totient φ(n) | 2024 |
| Square | 27984100 |
| Cube | 148035889000 |
| Square root | 72.732386 (= 23√10) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 116 |
| Scientific notation | 5.29 × |
5290 in other forms
| Form | Value |
|---|---|
| In words | five thousand two hundred and ninety |
| Binary (base 2) | 1010010101010 |
| Octal (base 8) | 12252 |
| Hexadecimal (base 16) | 14AA |
| Base 3 | 21020221 |
| As time | 5290 seconds = 1 h 28 min 10 s |
Is 5290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5290 ÷ 2 = 2645) | 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 | Yes (5290 ÷ 5 = 1058) | 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 5) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5290 ÷ 10 = 529) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5290 a prime number?
No. 5290 = 2 × 5 × , so it is divisible by 2.
What are the factors of 5290?
1, 2, 5, 10, 23, 46, 115, 230, 529, 1058, 2645, 5290.
What is 5290 in binary?
1010010101010 (hexadecimal 14AA, octal 12252).
What is the square root of 5290?
About 72.7324, exactly 23√10.
Is 5290 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 5290?
It is a composite number with 12 divisors.