The number 46064
46064 is a palindrome: it reads 46064 backwards too. Its prime factorisation is × 2879. Divisors (10): 1, 2, 4, 8, 16, 2879, 5758, 11516, 23032, 46064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46064: a palindrome: it reads 46064 backwards too.
- 2
46064 is composite. Its prime factorisation is
- 3
The divisors add up to 89280; without 46064 itself that is 43216, so 46064 is deficient (43216 is less than 46064). Euler's totient φ(46064) = 23024 numbers up to 46064 share no factor with it.
- 4
The digits of 46064 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 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46064 = 2^{4} \times 2879 \]46064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 89280 |
| Euler totient φ(n) | 23024 |
| Square | 2121892096 |
| Cube | 97742837510144 |
| Square root | 214.625255 (= 4√2879) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.6064 × |
46064 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand and sixty-four |
| Binary (base 2) | 1011001111110000 |
| Octal (base 8) | 131760 |
| Hexadecimal (base 16) | B3F0 |
| Base 3 | 2100012002 |
| As time | 46064 seconds = 12 h 47 min 44 s |
Is 46064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46064 ÷ 2 = 23032) | 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 | Yes (46064 ÷ 4 = 11516) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (46064 ÷ 8 = 5758) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46064 a prime number?
No. 46064 = × 2879, so it is divisible by 2.
What are the factors of 46064?
1, 2, 4, 8, 16, 2879, 5758, 11516, 23032, 46064.
What is 46064 in binary?
1011001111110000 (hexadecimal B3F0, octal 131760).
What is the square root of 46064?
About 214.6253, exactly 4√2879.
Is 46064 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 46064?
46064 is a palindrome: it reads 46064 backwards too.