The number 19639
19639 is a composite number with 4 divisors. Its prime factorisation is 41 × 479. Divisors (4): 1, 41, 479, 19639.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19639: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 41 × 479, the product of two primes.
- 2
19639 is composite. Its prime factorisation is
- 3
The divisors add up to 20160; without 19639 itself that is 521, so 19639 is deficient (521 is less than 19639). Euler's totient φ(19639) = 19120 numbers up to 19639 share no factor with it.
- 4
The digits of 19639 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19639 = 41 \times 479 \]
19639 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20160 |
| Euler totient φ(n) | 19120 |
| Square | 385690321 |
| Cube | 7574572214119 |
| Square root | 140.139216 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 74 |
| Scientific notation | 1.9639 × |
19639 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and thirty-nine |
| Binary (base 2) | 100110010110111 |
| Octal (base 8) | 46267 |
| Hexadecimal (base 16) | 4CB7 |
| Base 3 | 222221101 |
| As time | 19639 seconds = 5 h 27 min 19 s |
Is 19639 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 1) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19639 a prime number?
No. 19639 = 41 × 479, so it is divisible by 41.
What are the factors of 19639?
1, 41, 479, 19639.
What is 19639 in binary?
100110010110111 (hexadecimal 4CB7, octal 46267).
What is the square root of 19639?
About 140.1392.
Is 19639 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 19639?
19639 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 41 × 479, the product of two primes.