The number 64368
64368 is a composite number with 40 divisors. Its prime factorisation is × × 149. Divisors (40): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 36, 48, 54, 72 … 64368.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64368: a Harshad number: divisible by its digit sum 27.
- 2
64368 is composite. Its prime factorisation is
- 3
The divisors add up to 186000; without 64368 itself that is 121632, so 64368 is abundant (121632 is more than 64368). Euler's totient φ(64368) = 21312 numbers up to 64368 share no factor with it.
- 4
The digits of 64368 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 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64368 = 2^{4} \times 3^{3} \times 149 \]64368 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 186000 |
| Euler totient φ(n) | 21312 |
| Square | 4143239424 |
| Cube | 266692035244032 |
| Square root | 253.708494 (= 12√447) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 47 |
| Scientific notation | 6.4368 × |
64368 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand three hundred and sixty-eight |
| Binary (base 2) | 1111101101110000 |
| Octal (base 8) | 175560 |
| Hexadecimal (base 16) | FB70 |
| Base 3 | 10021022000 |
| As time | 64368 seconds = 17 h 52 min 48 s |
Is 64368 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64368 ÷ 2 = 32184) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (64368 ÷ 3 = 21456) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (64368 ÷ 4 = 16092) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (64368 ÷ 6 = 10728) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | Yes (64368 ÷ 8 = 8046) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (64368 ÷ 9 = 7152) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (64368 ÷ 12 = 5364) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64368 a prime number?
No. 64368 = × × 149, so it is divisible by 2.
What are the factors of 64368?
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 27, 36, 48, 54, 72, 108, 144, 149, 216, 298, 432, 447, 596, 894, 1192, 1341, 1788, 2384, 2682, 3576, 4023, 5364, 7152, 8046, 10728, 16092, 21456, 32184, 64368.
What is 64368 in binary?
1111101101110000 (hexadecimal FB70, octal 175560).
What is the square root of 64368?
About 253.7085, exactly 12√447.
Is 64368 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 64368?
64368 is a Harshad number: divisible by its digit sum 27.