The number 10147
10147 is a composite number with 4 divisors. Its prime factorisation is 73 × 139. Divisors (4): 1, 73, 139, 10147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10147: a semiprime: 73 × 139, the product of two primes.
- 2
10147 is composite. Its prime factorisation is
- 3
The divisors add up to 10360; without 10147 itself that is 213, so 10147 is deficient (213 is less than 10147). Euler's totient φ(10147) = 9936 numbers up to 10147 share no factor with it.
- 4
The digits of 10147 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 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10147 = 73 \times 139 \]
10147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 10360 |
| Euler totient φ(n) | 9936 |
| Square | 102961609 |
| Cube | 1044751446523 |
| Square root | 100.732319 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 34 |
| Scientific notation | 1.0147 × |
10147 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and forty-seven |
| Binary (base 2) | 10011110100011 |
| Octal (base 8) | 23643 |
| Hexadecimal (base 16) | 27A3 |
| Base 3 | 111220211 |
| As time | 10147 seconds = 2 h 49 min 7 s |
Is 10147 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 | No (remainder 4) | 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 5) | 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 10147 a prime number?
No. 10147 = 73 × 139, so it is divisible by 73.
What are the factors of 10147?
1, 73, 139, 10147.
What is 10147 in binary?
10011110100011 (hexadecimal 27A3, octal 23643).
What is the square root of 10147?
About 100.7323.
Is 10147 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 10147?
10147 is a semiprime: 73 × 139, the product of two primes.