The number 64055
64055 is a composite number with 8 divisors. Its prime factorisation is 5 × 23 × 557. Divisors (8): 1, 5, 23, 115, 557, 2785, 12811, 64055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64055 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64055 is composite. Its prime factorisation is
- 3
The divisors add up to 80352; without 64055 itself that is 16297, so 64055 is deficient (16297 is less than 64055). Euler's totient φ(64055) = 48928 numbers up to 64055 share no factor with it.
- 4
The digits of 64055 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 254 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64055 = 5 \times 23 \times 557 \]
64055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 80352 |
| Euler totient φ(n) | 48928 |
| Square | 4103043025 |
| Cube | 262820420966375 |
| Square root | 253.090893 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 254 |
| Scientific notation | 6.4055 × |
64055 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand and fifty-five |
| Binary (base 2) | 1111101000110111 |
| Octal (base 8) | 175067 |
| Hexadecimal (base 16) | FA37 |
| Base 3 | 10020212102 |
| As time | 64055 seconds = 17 h 47 min 35 s |
Is 64055 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64055 ÷ 5 = 12811) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64055 a prime number?
No. 64055 = 5 × 23 × 557, so it is divisible by 5.
What are the factors of 64055?
1, 5, 23, 115, 557, 2785, 12811, 64055.
What is 64055 in binary?
1111101000110111 (hexadecimal FA37, octal 175067).
What is the square root of 64055?
About 253.0909.
Is 64055 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 64055?
It is a composite number with 8 divisors.