The number 19625
19625 is a composite number with 8 divisors. Its prime factorisation is Ć 157. Divisors (8): 1, 5, 25, 125, 157, 785, 3925, 19625.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19625 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19625 is composite. Its prime factorisation is
- 3
The divisors add up to 24648; without 19625 itself that is 5023, so 19625 is deficient (5023 is less than 19625). Euler's totient Ļ(19625) = 15600 numbers up to 19625 share no factor with it.
- 4
The digits of 19625 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 149 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19625 = 5^{3} \times 157 \]19625 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24648 |
| Euler totient Ļ(n) | 15600 |
| Square | 385140625 |
| Cube | 7558384765625 |
| Square root | 140.089257 (= 5ā785) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 149 |
| Scientific notation | 1.9625 Ć |
19625 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and twenty-five |
| Binary (base 2) | 100110010101001 |
| Octal (base 8) | 46251 |
| Hexadecimal (base 16) | 4CA9 |
| Base 3 | 222220212 |
| As time | 19625 seconds = 5 h 27 min 5 s |
Is 19625 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (19625 Ć· 5 = 3925) | 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 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 1) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19625 a prime number?
No. 19625 = Ć 157, so it is divisible by 5.
What are the factors of 19625?
1, 5, 25, 125, 157, 785, 3925, 19625.
What is 19625 in binary?
100110010101001 (hexadecimal 4CA9, octal 46251).
What is the square root of 19625?
About 140.0893, exactly 5ā785.
Is 19625 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 19625?
It is a composite number with 8 divisors.