The number 10507
10507 is a composite number with 8 divisors. Its prime factorisation is 7 × 19 × 79. Divisors (8): 1, 7, 19, 79, 133, 553, 1501, 10507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10507 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10507 is composite. Its prime factorisation is
- 3
The divisors add up to 12800; without 10507 itself that is 2293, so 10507 is deficient (2293 is less than 10507). Euler's totient φ(10507) = 8424 numbers up to 10507 share no factor with it.
- 4
The digits of 10507 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10507 = 7 \times 19 \times 79 \]
10507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 12800 |
| Euler totient φ(n) | 8424 |
| Square | 110397049 |
| Cube | 1159941793843 |
| Square root | 102.503658 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.0507 × |
10507 in other forms
| Form | Value |
|---|---|
| In words | ten thousand five hundred and seven |
| Binary (base 2) | 10100100001011 |
| Octal (base 8) | 24413 |
| Hexadecimal (base 16) | 290B |
| Base 3 | 112102011 |
| As time | 10507 seconds = 2 h 55 min 7 s |
Is 10507 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (10507 ÷ 7 = 1501) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10507 a prime number?
No. 10507 = 7 × 19 × 79, so it is divisible by 7.
What are the factors of 10507?
1, 7, 19, 79, 133, 553, 1501, 10507.
What is 10507 in binary?
10100100001011 (hexadecimal 290B, octal 24413).
What is the square root of 10507?
About 102.5037.
Is 10507 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 10507?
It is a composite number with 8 divisors.