The number 11476
11476 is a triangular number: 1 + 2 + … + 151 = 11476. Its prime factorisation is × 19 × 151. Divisors (12): 1, 2, 4, 19, 38, 76, 151, 302, 604, 2869, 5738, 11476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11476: a triangular number: 1 + 2 + … + 151 = 11476; a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19.
- 2
11476 is composite. Its prime factorisation is
- 3
The divisors add up to 21280; without 11476 itself that is 9804, so 11476 is deficient (9804 is less than 11476). Euler's totient φ(11476) = 5400 numbers up to 11476 share no factor with it.
- 4
The digits of 11476 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11476 = 2^{2} \times 19 \times 151 \]11476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 21280 |
| Euler totient φ(n) | 5400 |
| Square | 131698576 |
| Cube | 1511372858176 |
| Square root | 107.126094 (= 2√2869) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.1476 × |
11476 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and seventy-six |
| Binary (base 2) | 10110011010100 |
| Octal (base 8) | 26324 |
| Hexadecimal (base 16) | 2CD4 |
| Base 3 | 120202001 |
| As time | 11476 seconds = 3 h 11 min 16 s |
Is 11476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11476 ÷ 2 = 5738) | 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 | Yes (11476 ÷ 4 = 2869) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11476 a prime number?
No. 11476 = × 19 × 151, so it is divisible by 2.
What are the factors of 11476?
1, 2, 4, 19, 38, 76, 151, 302, 604, 2869, 5738, 11476.
What is 11476 in binary?
10110011010100 (hexadecimal 2CD4, octal 26324).
What is the square root of 11476?
About 107.1261, exactly 2√2869.
Is 11476 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 11476?
11476 is a triangular number: 1 + 2 + … + 151 = 11476; a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19.