The number 14641
14641 is a perfect power (), a perfect square (121²) and a palindrome: it reads 14641 backwards too. Its prime factorisation is . Divisors (5): 1, 11, 121, 1331, 14641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14641: a perfect power (); a perfect square (121²); a palindrome: it reads 14641 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
14641 is composite. Its prime factorisation is
- 3
The divisors add up to 16105; without 14641 itself that is 1464, so 14641 is deficient (1464 is less than 14641). Euler's totient φ(14641) = 13310 numbers up to 14641 share no factor with it.
- 4
The digits of 14641 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14641 = 11^{4} \]14641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 5 |
| Sum of divisors | 16105 |
| Euler totient φ(n) | 13310 |
| Square | 214358881 |
| Cube | 3138428376721 |
| Square root | 121 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.4641 × |
| Perfect power |
14641 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and forty-one |
| Binary (base 2) | 11100100110001 |
| Octal (base 8) | 34461 |
| Hexadecimal (base 16) | 3931 |
| Base 3 | 202002021 |
| As time | 14641 seconds = 4 h 4 min 1 s |
Is 14641 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 1) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 (14641 ÷ 11 = 1331) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14641 a prime number?
No. 14641 = , so it is divisible by 11.
What are the factors of 14641?
1, 11, 121, 1331, 14641.
What is 14641 in binary?
11100100110001 (hexadecimal 3931, octal 34461).
What is the square root of 14641?
121, because 121 × 121 = 14641.
Is 14641 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 14641?
14641 is a perfect power (); a perfect square (121²); a palindrome: it reads 14641 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.