The number 64150
64150 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1283. Divisors (12): 1, 2, 5, 10, 25, 50, 1283, 2566, 6415, 12830, 32075, 64150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64150 is composite. Its prime factorisation is
- 3
The divisors add up to 119412; without 64150 itself that is 55262, so 64150 is deficient (55262 is less than 64150). Euler's totient φ(64150) = 25640 numbers up to 64150 share no factor with it.
- 4
The digits of 64150 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64150 = 2 \times 5^{2} \times 1283 \]64150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 119412 |
| Euler totient φ(n) | 25640 |
| Square | 4115222500 |
| Cube | 263991523375000 |
| Square root | 253.278503 (= 5√2566) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.415 × |
64150 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand one hundred and fifty |
| Binary (base 2) | 1111101010010110 |
| Octal (base 8) | 175226 |
| Hexadecimal (base 16) | FA96 |
| Base 3 | 10020222221 |
| As time | 64150 seconds = 17 h 49 min 10 s |
Is 64150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64150 ÷ 2 = 32075) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64150 ÷ 5 = 12830) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (64150 ÷ 10 = 6415) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64150 a prime number?
No. 64150 = 2 × × 1283, so it is divisible by 2.
What are the factors of 64150?
1, 2, 5, 10, 25, 50, 1283, 2566, 6415, 12830, 32075, 64150.
What is 64150 in binary?
1111101010010110 (hexadecimal FA96, octal 175226).
What is the square root of 64150?
About 253.2785, exactly 5√2566.
Is 64150 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 64150?
It is a composite number with 12 divisors.