The number 10500
10500 is a composite number with 48 divisors. Its prime factorisation is × 3 × × 7. Divisors (48): 1, 2, 3, 4, 5, 6, 7, 10, 12, 14, 15, 20, 21, 25, 28, 30 … 10500.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10500: a Harshad number: divisible by its digit sum 6.
- 2
10500 is composite. Its prime factorisation is
- 3
The divisors add up to 34944; without 10500 itself that is 24444, so 10500 is abundant (24444 is more than 10500). Euler's totient φ(10500) = 2400 numbers up to 10500 share no factor with it.
- 4
The digits of 10500 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10500 = 2^{2} \times 3 \times 5^{3} \times 7 \]10500 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 34944 |
| Euler totient φ(n) | 2400 |
| Square | 110250000 |
| Cube | 1157625000000 |
| Square root | 102.469508 (= 10√105) |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.05 × |
10500 in other forms
| Form | Value |
|---|---|
| In words | ten thousand five hundred |
| Binary (base 2) | 10100100000100 |
| Octal (base 8) | 24404 |
| Hexadecimal (base 16) | 2904 |
| Base 3 | 112101220 |
| As time | 10500 seconds = 2 h 55 min 0 s |
Is 10500 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10500 ÷ 2 = 5250) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10500 ÷ 3 = 3500) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (10500 ÷ 4 = 2625) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (10500 ÷ 5 = 2100) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (10500 ÷ 6 = 1750) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (10500 ÷ 7 = 1500) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10500 ÷ 10 = 1050) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (10500 ÷ 12 = 875) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10500 a prime number?
No. 10500 = × 3 × × 7, so it is divisible by 2.
What are the factors of 10500?
1, 2, 3, 4, 5, 6, 7, 10, 12, 14, 15, 20, 21, 25, 28, 30, 35, 42, 50, 60, 70, 75, 84, 100, 105, 125, 140, 150, 175, 210, 250, 300, 350, 375, 420, 500, 525, 700, 750, 875, 1050, 1500, 1750, 2100, 2625, 3500, 5250, 10500.
What is 10500 in binary?
10100100000100 (hexadecimal 2904, octal 24404).
What is the square root of 10500?
About 102.4695, exactly 10√105.
Is 10500 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 10500?
10500 is a Harshad number: divisible by its digit sum 6.