The number 14913
14913 is a composite number with 6 divisors. Its prime factorisation is × 1657. Divisors (6): 1, 3, 9, 1657, 4971, 14913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14913 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14913 is composite. Its prime factorisation is
- 3
The divisors add up to 21554; without 14913 itself that is 6641, so 14913 is deficient (6641 is less than 14913). Euler's totient φ(14913) = 9936 numbers up to 14913 share no factor with it.
- 4
The digits of 14913 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14913 = 3^{2} \times 1657 \]14913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 21554 |
| Euler totient φ(n) | 9936 |
| Square | 222397569 |
| Cube | 3316614946497 |
| Square root | 122.118795 (= 3√1657) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4913 × |
14913 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and thirteen |
| Binary (base 2) | 11101001000001 |
| Octal (base 8) | 35101 |
| Hexadecimal (base 16) | 3A41 |
| Base 3 | 202110100 |
| As time | 14913 seconds = 4 h 8 min 33 s |
Is 14913 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 | Yes (14913 ÷ 3 = 4971) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14913 ÷ 9 = 1657) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14913 a prime number?
No. 14913 = × 1657, so it is divisible by 3.
What are the factors of 14913?
1, 3, 9, 1657, 4971, 14913.
What is 14913 in binary?
11101001000001 (hexadecimal 3A41, octal 35101).
What is the square root of 14913?
About 122.1188, exactly 3√1657.
Is 14913 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14913?
It is a composite number with 6 divisors.