The number 19799
19799 is a composite number with 4 divisors. Its prime factorisation is 13 × 1523. Divisors (4): 1, 13, 1523, 19799.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19799: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 1523, the product of two primes.
- 2
19799 is composite. Its prime factorisation is
- 3
The divisors add up to 21336; without 19799 itself that is 1537, so 19799 is deficient (1537 is less than 19799). Euler's totient φ(19799) = 18264 numbers up to 19799 share no factor with it.
- 4
The digits of 19799 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19799 = 13 \times 1523 \]
19799 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21336 |
| Euler totient φ(n) | 18264 |
| Square | 392000401 |
| Cube | 7761215939399 |
| Square root | 140.708919 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.9799 × |
19799 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand seven hundred and ninety-nine |
| Binary (base 2) | 100110101010111 |
| Octal (base 8) | 46527 |
| Hexadecimal (base 16) | 4D57 |
| Base 3 | 1000011022 |
| As time | 19799 seconds = 5 h 29 min 59 s |
Is 19799 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 10) | 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 19799 a prime number?
No. 19799 = 13 × 1523, so it is divisible by 13.
What are the factors of 19799?
1, 13, 1523, 19799.
What is 19799 in binary?
100110101010111 (hexadecimal 4D57, octal 46527).
What is the square root of 19799?
About 140.7089.
Is 19799 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 19799?
19799 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 1523, the product of two primes.