The number 10130
10130 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1013. Divisors (8): 1, 2, 5, 10, 1013, 2026, 5065, 10130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10130: a Harshad number: divisible by its digit sum 5.
- 2
10130 is composite. Its prime factorisation is
- 3
The divisors add up to 18252; without 10130 itself that is 8122, so 10130 is deficient (8122 is less than 10130). Euler's totient φ(10130) = 4048 numbers up to 10130 share no factor with it.
- 4
The digits of 10130 add up to 5, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10130 = 2 \times 5 \times 1013 \]
10130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18252 |
| Euler totient φ(n) | 4048 |
| Square | 102616900 |
| Cube | 1039509197000 |
| Square root | 100.647901 |
| Digit sum / digital root | 5 / 5 |
| Collatz steps to 1 | 73 |
| Scientific notation | 1.013 × |
10130 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and thirty |
| Binary (base 2) | 10011110010010 |
| Octal (base 8) | 23622 |
| Hexadecimal (base 16) | 2792 |
| Base 3 | 111220012 |
| As time | 10130 seconds = 2 h 48 min 50 s |
Is 10130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10130 ÷ 2 = 5065) | 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 (10130 ÷ 5 = 2026) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10130 ÷ 10 = 1013) | 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 10130 a prime number?
No. 10130 = 2 × 5 × 1013, so it is divisible by 2.
What are the factors of 10130?
1, 2, 5, 10, 1013, 2026, 5065, 10130.
What is 10130 in binary?
10011110010010 (hexadecimal 2792, octal 23622).
What is the square root of 10130?
About 100.6479.
Is 10130 divisible by 3?
No. Its digits add up to 5, which is not a multiple of 3.
What is special about the number 10130?
10130 is a Harshad number: divisible by its digit sum 5.