The number 64476
64476 is a composite number with 30 divisors. Its prime factorisation is × × 199. Divisors (30): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 81, 108, 162, 199, 324 … 64476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64476: a Harshad number: divisible by its digit sum 27.
- 2
64476 is composite. Its prime factorisation is
- 3
The divisors add up to 169400; without 64476 itself that is 104924, so 64476 is abundant (104924 is more than 64476). Euler's totient φ(64476) = 21384 numbers up to 64476 share no factor with it.
- 4
The digits of 64476 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64476 = 2^{2} \times 3^{4} \times 199 \]64476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 169400 |
| Euler totient φ(n) | 21384 |
| Square | 4157154576 |
| Cube | 268036698442176 |
| Square root | 253.921248 (= 18√199) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.4476 × |
64476 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand four hundred and seventy-six |
| Binary (base 2) | 1111101111011100 |
| Octal (base 8) | 175734 |
| Hexadecimal (base 16) | FBDC |
| Base 3 | 10021110000 |
| As time | 64476 seconds = 17 h 54 min 36 s |
Is 64476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64476 ÷ 2 = 32238) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (64476 ÷ 3 = 21492) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (64476 ÷ 4 = 16119) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (64476 ÷ 6 = 10746) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (64476 ÷ 9 = 7164) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 | Yes (64476 ÷ 12 = 5373) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64476 a prime number?
No. 64476 = × × 199, so it is divisible by 2.
What are the factors of 64476?
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 81, 108, 162, 199, 324, 398, 597, 796, 1194, 1791, 2388, 3582, 5373, 7164, 10746, 16119, 21492, 32238, 64476.
What is 64476 in binary?
1111101111011100 (hexadecimal FBDC, octal 175734).
What is the square root of 64476?
About 253.9212, exactly 18√199.
Is 64476 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 64476?
64476 is a Harshad number: divisible by its digit sum 27.