The number 19629
19629 is a composite number with 8 divisors. Its prime factorisation is × 727. Divisors (8): 1, 3, 9, 27, 727, 2181, 6543, 19629.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19629: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
19629 is composite. Its prime factorisation is
- 3
The divisors add up to 29120; without 19629 itself that is 9491, so 19629 is deficient (9491 is less than 19629). Euler's totient φ(19629) = 13068 numbers up to 19629 share no factor with it.
- 4
The digits of 19629 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19629 = 3^{3} \times 727 \]19629 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 29120 |
| Euler totient φ(n) | 13068 |
| Square | 385297641 |
| Cube | 7563007395189 |
| Square root | 140.103533 (= 3√2181) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 136 |
| Scientific notation | 1.9629 × |
19629 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and twenty-nine |
| Binary (base 2) | 100110010101101 |
| Octal (base 8) | 46255 |
| Hexadecimal (base 16) | 4CAD |
| Base 3 | 222221000 |
| As time | 19629 seconds = 5 h 27 min 9 s |
Is 19629 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 (19629 ÷ 3 = 6543) | 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 4) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (19629 ÷ 9 = 2181) | 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 5) | 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 19629 a prime number?
No. 19629 = × 727, so it is divisible by 3.
What are the factors of 19629?
1, 3, 9, 27, 727, 2181, 6543, 19629.
What is 19629 in binary?
100110010101101 (hexadecimal 4CAD, octal 46255).
What is the square root of 19629?
About 140.1035, exactly 3√2181.
Is 19629 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 19629?
19629 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.