The number 64531
64531 is a composite number with 4 divisors. Its prime factorisation is 47 × 1373. Divisors (4): 1, 47, 1373, 64531.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64531: a semiprime: 47 × 1373, the product of two primes.
- 2
64531 is composite. Its prime factorisation is
- 3
The divisors add up to 65952; without 64531 itself that is 1421, so 64531 is deficient (1421 is less than 64531). Euler's totient φ(64531) = 63112 numbers up to 64531 share no factor with it.
- 4
The digits of 64531 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64531 = 47 \times 1373 \]
64531 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65952 |
| Euler totient φ(n) | 63112 |
| Square | 4164249961 |
| Cube | 268723214233291 |
| Square root | 254.029526 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 99 |
| Scientific notation | 6.4531 × |
64531 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand five hundred and thirty-one |
| Binary (base 2) | 1111110000010011 |
| Octal (base 8) | 176023 |
| Hexadecimal (base 16) | FC13 |
| Base 3 | 10021112001 |
| As time | 64531 seconds = 17 h 55 min 31 s |
Is 64531 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 3) | 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 | No (remainder 1) | 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 3) | 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 1) | 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 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64531 a prime number?
No. 64531 = 47 × 1373, so it is divisible by 47.
What are the factors of 64531?
1, 47, 1373, 64531.
What is 64531 in binary?
1111110000010011 (hexadecimal FC13, octal 176023).
What is the square root of 64531?
About 254.0295.
Is 64531 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 64531?
64531 is a semiprime: 47 × 1373, the product of two primes.