The number 64050
64050 is a composite number with 48 divisors. Its prime factorisation is 2 × 3 × × 7 × 61. Divisors (48): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 25, 30, 35, 42, 50, 61 … 64050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64050: a Harshad number: divisible by its digit sum 15.
- 2
64050 is composite. Its prime factorisation is
- 3
The divisors add up to 184512; without 64050 itself that is 120462, so 64050 is abundant (120462 is more than 64050). Euler's totient φ(64050) = 14400 numbers up to 64050 share no factor with it.
- 4
The digits of 64050 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64050 = 2 \times 3 \times 5^{2} \times 7 \times 61 \]64050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 184512 |
| Euler totient φ(n) | 14400 |
| Square | 4102402500 |
| Cube | 262758880125000 |
| Square root | 253.081015 (= 5√2562) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.405 × |
64050 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand and fifty |
| Binary (base 2) | 1111101000110010 |
| Octal (base 8) | 175062 |
| Hexadecimal (base 16) | FA32 |
| Base 3 | 10020212020 |
| As time | 64050 seconds = 17 h 47 min 30 s |
Is 64050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64050 ÷ 2 = 32025) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (64050 ÷ 3 = 21350) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64050 ÷ 5 = 12810) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (64050 ÷ 6 = 10675) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (64050 ÷ 7 = 9150) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (64050 ÷ 10 = 6405) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64050 a prime number?
No. 64050 = 2 × 3 × × 7 × 61, so it is divisible by 2.
What are the factors of 64050?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 25, 30, 35, 42, 50, 61, 70, 75, 105, 122, 150, 175, 183, 210, 305, 350, 366, 427, 525, 610, 854, 915, 1050, 1281, 1525, 1830, 2135, 2562, 3050, 4270, 4575, 6405, 9150, 10675, 12810, 21350, 32025, 64050.
What is 64050 in binary?
1111101000110010 (hexadecimal FA32, octal 175062).
What is the square root of 64050?
About 253.0810, exactly 5√2562.
Is 64050 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 64050?
64050 is a Harshad number: divisible by its digit sum 15.