The number 14911
14911 is a composite number with 8 divisors. Its prime factorisation is 13 × 31 × 37. Divisors (8): 1, 13, 31, 37, 403, 481, 1147, 14911.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14911: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
14911 is composite. Its prime factorisation is
- 3
The divisors add up to 17024; without 14911 itself that is 2113, so 14911 is deficient (2113 is less than 14911). Euler's totient φ(14911) = 12960 numbers up to 14911 share no factor with it.
- 4
The digits of 14911 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 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14911 = 13 \times 31 \times 37 \]
14911 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17024 |
| Euler totient φ(n) | 12960 |
| Square | 222337921 |
| Cube | 3315280740031 |
| Square root | 122.110606 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4911 × |
14911 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and eleven |
| Binary (base 2) | 11101000111111 |
| Octal (base 8) | 35077 |
| Hexadecimal (base 16) | 3A3F |
| Base 3 | 202110021 |
| As time | 14911 seconds = 4 h 8 min 31 s |
Is 14911 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 7) | 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 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14911 a prime number?
No. 14911 = 13 × 31 × 37, so it is divisible by 13.
What are the factors of 14911?
1, 13, 31, 37, 403, 481, 1147, 14911.
What is 14911 in binary?
11101000111111 (hexadecimal 3A3F, octal 35077).
What is the square root of 14911?
About 122.1106.
Is 14911 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 14911?
14911 is a happy number: repeatedly adding the squares of its digits reaches 1.