The number 10451
10451 is a composite number with 4 divisors. Its prime factorisation is 7 × 1493. Divisors (4): 1, 7, 1493, 10451.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10451: a semiprime: 7 × 1493, the product of two primes.
- 2
10451 is composite. Its prime factorisation is
- 3
The divisors add up to 11952; without 10451 itself that is 1501, so 10451 is deficient (1501 is less than 10451). Euler's totient φ(10451) = 8952 numbers up to 10451 share no factor with it.
- 4
The digits of 10451 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10451 = 7 \times 1493 \]
10451 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11952 |
| Euler totient φ(n) | 8952 |
| Square | 109223401 |
| Cube | 1141493763851 |
| Square root | 102.230133 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 86 |
| Scientific notation | 1.0451 × |
10451 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and fifty-one |
| Binary (base 2) | 10100011010011 |
| Octal (base 8) | 24323 |
| Hexadecimal (base 16) | 28D3 |
| Base 3 | 112100002 |
| As time | 10451 seconds = 2 h 54 min 11 s |
Is 10451 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 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (10451 ÷ 7 = 1493) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10451 a prime number?
No. 10451 = 7 × 1493, so it is divisible by 7.
What are the factors of 10451?
1, 7, 1493, 10451.
What is 10451 in binary?
10100011010011 (hexadecimal 28D3, octal 24323).
What is the square root of 10451?
About 102.2301.
Is 10451 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 10451?
10451 is a semiprime: 7 × 1493, the product of two primes.