The number 14099
14099 is a composite number with 4 divisors. Its prime factorisation is 23 × 613. Divisors (4): 1, 23, 613, 14099.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14099: a Harshad number: divisible by its digit sum 23; a semiprime: 23 × 613, the product of two primes.
- 2
14099 is composite. Its prime factorisation is
- 3
The divisors add up to 14736; without 14099 itself that is 637, so 14099 is deficient (637 is less than 14099). Euler's totient φ(14099) = 13464 numbers up to 14099 share no factor with it.
- 4
The digits of 14099 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14099 = 23 \times 613 \]
14099 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14736 |
| Euler totient φ(n) | 13464 |
| Square | 198781801 |
| Cube | 2802624612299 |
| Square root | 118.739210 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.4099 × |
14099 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and ninety-nine |
| Binary (base 2) | 11011100010011 |
| Octal (base 8) | 33423 |
| Hexadecimal (base 16) | 3713 |
| Base 3 | 201100012 |
| As time | 14099 seconds = 3 h 54 min 59 s |
Is 14099 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 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14099 a prime number?
No. 14099 = 23 × 613, so it is divisible by 23.
What are the factors of 14099?
1, 23, 613, 14099.
What is 14099 in binary?
11011100010011 (hexadecimal 3713, octal 33423).
What is the square root of 14099?
About 118.7392.
Is 14099 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 14099?
14099 is a Harshad number: divisible by its digit sum 23; a semiprime: 23 × 613, the product of two primes.