The number 14901
14901 is a composite number with 4 divisors. Its prime factorisation is 3 × 4967. Divisors (4): 1, 3, 4967, 14901.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14901: a semiprime: 3 × 4967, the product of two primes.
- 2
14901 is composite. Its prime factorisation is
- 3
The divisors add up to 19872; without 14901 itself that is 4971, so 14901 is deficient (4971 is less than 14901). Euler's totient φ(14901) = 9932 numbers up to 14901 share no factor with it.
- 4
The digits of 14901 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 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14901 = 3 \times 4967 \]
14901 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19872 |
| Euler totient φ(n) | 9932 |
| Square | 222039801 |
| Cube | 3308615074701 |
| Square root | 122.069652 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.4901 × |
14901 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and one |
| Binary (base 2) | 11101000110101 |
| Octal (base 8) | 35065 |
| Hexadecimal (base 16) | 3A35 |
| Base 3 | 202102220 |
| As time | 14901 seconds = 4 h 8 min 21 s |
Is 14901 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 (14901 ÷ 3 = 4967) | 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 3) | 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 5) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 14901 a prime number?
No. 14901 = 3 × 4967, so it is divisible by 3.
What are the factors of 14901?
1, 3, 4967, 14901.
What is 14901 in binary?
11101000110101 (hexadecimal 3A35, octal 35065).
What is the square root of 14901?
About 122.0697.
Is 14901 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14901?
14901 is a semiprime: 3 × 4967, the product of two primes.