The number 31060
31060 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1553. Divisors (12): 1, 2, 4, 5, 10, 20, 1553, 3106, 6212, 7765, 15530, 31060.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 31060: a Harshad number: divisible by its digit sum 10.
- 2
31060 is composite. Its prime factorisation is
- 3
The divisors add up to 65268; without 31060 itself that is 34208, so 31060 is abundant (34208 is more than 31060). Euler's totient φ(31060) = 12416 numbers up to 31060 share no factor with it.
- 4
The digits of 31060 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 103 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31060 = 2^{2} \times 5 \times 1553 \]31060 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 65268 |
| Euler totient φ(n) | 12416 |
| Square | 964723600 |
| Cube | 29964315016000 |
| Square root | 176.238475 (= 2√7765) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 103 |
| Scientific notation | 3.106 × |
31060 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand and sixty |
| Binary (base 2) | 111100101010100 |
| Octal (base 8) | 74524 |
| Hexadecimal (base 16) | 7954 |
| Base 3 | 1120121101 |
| As time | 31060 seconds = 8 h 37 min 40 s |
Is 31060 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (31060 ÷ 2 = 15530) | 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 | Yes (31060 ÷ 4 = 7765) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (31060 ÷ 5 = 6212) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (31060 ÷ 10 = 3106) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 31060 a prime number?
No. 31060 = × 5 × 1553, so it is divisible by 2.
What are the factors of 31060?
1, 2, 4, 5, 10, 20, 1553, 3106, 6212, 7765, 15530, 31060.
What is 31060 in binary?
111100101010100 (hexadecimal 7954, octal 74524).
What is the square root of 31060?
About 176.2385, exactly 2√7765.
Is 31060 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 31060?
31060 is a Harshad number: divisible by its digit sum 10.