The number 14910
14910 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 7 × 71. Divisors (32): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 71, 105 … 14910.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14910: a Harshad number: divisible by its digit sum 15.
- 2
14910 is composite. Its prime factorisation is
- 3
The divisors add up to 41472; without 14910 itself that is 26562, so 14910 is abundant (26562 is more than 14910). Euler's totient φ(14910) = 3360 numbers up to 14910 share no factor with it.
- 4
The digits of 14910 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14910 = 2 \times 3 \times 5 \times 7 \times 71 \]
14910 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 41472 |
| Euler totient φ(n) | 3360 |
| Square | 222308100 |
| Cube | 3314613771000 |
| Square root | 122.106511 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.491 × |
14910 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and ten |
| Binary (base 2) | 11101000111110 |
| Octal (base 8) | 35076 |
| Hexadecimal (base 16) | 3A3E |
| Base 3 | 202110020 |
| As time | 14910 seconds = 4 h 8 min 30 s |
Is 14910 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14910 ÷ 2 = 7455) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14910 ÷ 3 = 4970) | 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 | Yes (14910 ÷ 5 = 2982) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14910 ÷ 6 = 2485) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (14910 ÷ 7 = 2130) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14910 ÷ 10 = 1491) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14910 a prime number?
No. 14910 = 2 × 3 × 5 × 7 × 71, so it is divisible by 2.
What are the factors of 14910?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 71, 105, 142, 210, 213, 355, 426, 497, 710, 994, 1065, 1491, 2130, 2485, 2982, 4970, 7455, 14910.
What is 14910 in binary?
11101000111110 (hexadecimal 3A3E, octal 35076).
What is the square root of 14910?
About 122.1065.
Is 14910 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14910?
14910 is a Harshad number: divisible by its digit sum 15.