The number 64948
64948 is a composite number with 12 divisors. Its prime factorisation is × 13 × 1249. Divisors (12): 1, 2, 4, 13, 26, 52, 1249, 2498, 4996, 16237, 32474, 64948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
64948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
64948 is composite. Its prime factorisation is
- 3
The divisors add up to 122500; without 64948 itself that is 57552, so 64948 is deficient (57552 is less than 64948). Euler's totient φ(64948) = 29952 numbers up to 64948 share no factor with it.
- 4
The digits of 64948 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64948 = 2^{2} \times 13 \times 1249 \]64948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 122500 |
| Euler totient φ(n) | 29952 |
| Square | 4218242704 |
| Cube | 273966427139392 |
| Square root | 254.848975 (= 2√16237) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 68 |
| Scientific notation | 6.4948 × |
64948 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand nine hundred and forty-eight |
| Binary (base 2) | 1111110110110100 |
| Octal (base 8) | 176664 |
| Hexadecimal (base 16) | FDB4 |
| Base 3 | 10022002111 |
| As time | 64948 seconds = 18 h 2 min 28 s |
Is 64948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64948 ÷ 2 = 32474) | 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 | Yes (64948 ÷ 4 = 16237) | 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 | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64948 a prime number?
No. 64948 = × 13 × 1249, so it is divisible by 2.
What are the factors of 64948?
1, 2, 4, 13, 26, 52, 1249, 2498, 4996, 16237, 32474, 64948.
What is 64948 in binary?
1111110110110100 (hexadecimal FDB4, octal 176664).
What is the square root of 64948?
About 254.8490, exactly 2√16237.
Is 64948 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 64948?
It is a composite number with 12 divisors.