The number 10150
10150 is a composite number with 24 divisors. Its prime factorisation is 2 × × 7 × 29. Divisors (24): 1, 2, 5, 7, 10, 14, 25, 29, 35, 50, 58, 70, 145, 175, 203, 290 … 10150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10150: a Harshad number: divisible by its digit sum 7.
- 2
10150 is composite. Its prime factorisation is
- 3
The divisors add up to 22320; without 10150 itself that is 12170, so 10150 is abundant (12170 is more than 10150). Euler's totient φ(10150) = 3360 numbers up to 10150 share no factor with it.
- 4
The digits of 10150 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10150 = 2 \times 5^{2} \times 7 \times 29 \]10150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 22320 |
| Euler totient φ(n) | 3360 |
| Square | 103022500 |
| Cube | 1045678375000 |
| Square root | 100.747208 (= 5√406) |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 135 |
| Scientific notation | 1.015 × |
10150 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and fifty |
| Binary (base 2) | 10011110100110 |
| Octal (base 8) | 23646 |
| Hexadecimal (base 16) | 27A6 |
| Base 3 | 111220221 |
| As time | 10150 seconds = 2 h 49 min 10 s |
Is 10150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10150 ÷ 2 = 5075) | 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 (10150 ÷ 5 = 2030) | 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 | Yes (10150 ÷ 7 = 1450) | 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 6) | 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 (10150 ÷ 10 = 1015) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 10150 a prime number?
No. 10150 = 2 × × 7 × 29, so it is divisible by 2.
What are the factors of 10150?
1, 2, 5, 7, 10, 14, 25, 29, 35, 50, 58, 70, 145, 175, 203, 290, 350, 406, 725, 1015, 1450, 2030, 5075, 10150.
What is 10150 in binary?
10011110100110 (hexadecimal 27A6, octal 23646).
What is the square root of 10150?
About 100.7472, exactly 5√406.
Is 10150 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 10150?
10150 is a Harshad number: divisible by its digit sum 7.