The number 64477
64477 is a composite number with 8 divisors. Its prime factorisation is 7 × 61 × 151. Divisors (8): 1, 7, 61, 151, 427, 1057, 9211, 64477.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64477 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64477 is composite. Its prime factorisation is
- 3
The divisors add up to 75392; without 64477 itself that is 10915, so 64477 is deficient (10915 is less than 64477). Euler's totient φ(64477) = 54000 numbers up to 64477 share no factor with it.
- 4
The digits of 64477 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64477 = 7 \times 61 \times 151 \]
64477 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75392 |
| Euler totient φ(n) | 54000 |
| Square | 4157283529 |
| Cube | 268049170099333 |
| Square root | 253.923217 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.4477 × |
64477 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand four hundred and seventy-seven |
| Binary (base 2) | 1111101111011101 |
| Octal (base 8) | 175735 |
| Hexadecimal (base 16) | FBDD |
| Base 3 | 10021110001 |
| As time | 64477 seconds = 17 h 54 min 37 s |
Is 64477 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 1) | 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 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (64477 ÷ 7 = 9211) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64477 a prime number?
No. 64477 = 7 × 61 × 151, so it is divisible by 7.
What are the factors of 64477?
1, 7, 61, 151, 427, 1057, 9211, 64477.
What is 64477 in binary?
1111101111011101 (hexadecimal FBDD, octal 175735).
What is the square root of 64477?
About 253.9232.
Is 64477 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 64477?
It is a composite number with 8 divisors.