The number 11451
11451 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 347. Divisors (8): 1, 3, 11, 33, 347, 1041, 3817, 11451.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11451: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
11451 is composite. Its prime factorisation is
- 3
The divisors add up to 16704; without 11451 itself that is 5253, so 11451 is deficient (5253 is less than 11451). Euler's totient φ(11451) = 6920 numbers up to 11451 share no factor with it.
- 4
The digits of 11451 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11451 = 3 \times 11 \times 347 \]
11451 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 16704 |
| Euler totient φ(n) | 6920 |
| Square | 131125401 |
| Cube | 1501516966851 |
| Square root | 107.009345 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1451 × |
11451 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and fifty-one |
| Binary (base 2) | 10110010111011 |
| Octal (base 8) | 26273 |
| Hexadecimal (base 16) | 2CBB |
| Base 3 | 120201010 |
| As time | 11451 seconds = 3 h 10 min 51 s |
Is 11451 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 | Yes (11451 ÷ 3 = 3817) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 3) | 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 | Yes (11451 ÷ 11 = 1041) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11451 a prime number?
No. 11451 = 3 × 11 × 347, so it is divisible by 3.
What are the factors of 11451?
1, 3, 11, 33, 347, 1041, 3817, 11451.
What is 11451 in binary?
10110010111011 (hexadecimal 2CBB, octal 26273).
What is the square root of 11451?
About 107.0093.
Is 11451 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11451?
11451 is a happy number: repeatedly adding the squares of its digits reaches 1.