The number 64230
64230 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 2141. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 2141, 4282, 6423, 10705, 12846, 21410, 32115, 64230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64230: a Harshad number: divisible by its digit sum 15.
- 2
64230 is composite. Its prime factorisation is
- 3
The divisors add up to 154224; without 64230 itself that is 89994, so 64230 is abundant (89994 is more than 64230). Euler's totient φ(64230) = 17120 numbers up to 64230 share no factor with it.
- 4
The digits of 64230 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64230 = 2 \times 3 \times 5 \times 2141 \]
64230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 154224 |
| Euler totient φ(n) | 17120 |
| Square | 4125492900 |
| Cube | 264980408967000 |
| Square root | 253.436383 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.423 × |
64230 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand two hundred and thirty |
| Binary (base 2) | 1111101011100110 |
| Octal (base 8) | 175346 |
| Hexadecimal (base 16) | FAE6 |
| Base 3 | 10021002220 |
| As time | 64230 seconds = 17 h 50 min 30 s |
Is 64230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64230 ÷ 2 = 32115) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (64230 ÷ 3 = 21410) | 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 (64230 ÷ 5 = 12846) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (64230 ÷ 6 = 10705) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | 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 (64230 ÷ 10 = 6423) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64230 a prime number?
No. 64230 = 2 × 3 × 5 × 2141, so it is divisible by 2.
What are the factors of 64230?
1, 2, 3, 5, 6, 10, 15, 30, 2141, 4282, 6423, 10705, 12846, 21410, 32115, 64230.
What is 64230 in binary?
1111101011100110 (hexadecimal FAE6, octal 175346).
What is the square root of 64230?
About 253.4364.
Is 64230 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 64230?
64230 is a Harshad number: divisible by its digit sum 15.