The number 10946
10946 is a Fibonacci number. Its prime factorisation is 2 × 13 × 421. Divisors (8): 1, 2, 13, 26, 421, 842, 5473, 10946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10946: a Fibonacci number.
- 2
10946 is composite. Its prime factorisation is
- 3
The divisors add up to 17724; without 10946 itself that is 6778, so 10946 is deficient (6778 is less than 10946). Euler's totient φ(10946) = 5040 numbers up to 10946 share no factor with it.
- 4
The digits of 10946 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10946 = 2 \times 13 \times 421 \]
10946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17724 |
| Euler totient φ(n) | 5040 |
| Square | 119814916 |
| Cube | 1311494070536 |
| Square root | 104.623133 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 161 |
| Scientific notation | 1.0946 × |
10946 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and forty-six |
| Binary (base 2) | 10101011000010 |
| Octal (base 8) | 25302 |
| Hexadecimal (base 16) | 2AC2 |
| Base 3 | 120000102 |
| As time | 10946 seconds = 3 h 2 min 26 s |
Is 10946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10946 ÷ 2 = 5473) | 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 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | 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 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10946 a prime number?
No. 10946 = 2 × 13 × 421, so it is divisible by 2.
What are the factors of 10946?
1, 2, 13, 26, 421, 842, 5473, 10946.
What is 10946 in binary?
10101011000010 (hexadecimal 2AC2, octal 25302).
What is the square root of 10946?
About 104.6231.
Is 10946 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 10946?
10946 is a Fibonacci number.