The number 46364
46364 is a palindrome: it reads 46364 backwards too. Its prime factorisation is × 67 × 173. Divisors (12): 1, 2, 4, 67, 134, 173, 268, 346, 692, 11591, 23182, 46364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46364: a palindrome: it reads 46364 backwards too.
- 2
46364 is composite. Its prime factorisation is
- 3
The divisors add up to 82824; without 46364 itself that is 36460, so 46364 is deficient (36460 is less than 46364). Euler's totient φ(46364) = 22704 numbers up to 46364 share no factor with it.
- 4
The digits of 46364 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46364 = 2^{2} \times 67 \times 173 \]46364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 82824 |
| Euler totient φ(n) | 22704 |
| Square | 2149620496 |
| Cube | 99665004676544 |
| Square root | 215.323013 (= 2√11591) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.6364 × |
46364 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand three hundred and sixty-four |
| Binary (base 2) | 1011010100011100 |
| Octal (base 8) | 132434 |
| Hexadecimal (base 16) | B51C |
| Base 3 | 2100121012 |
| As time | 46364 seconds = 12 h 52 min 44 s |
Is 46364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46364 ÷ 2 = 23182) | 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 (46364 ÷ 4 = 11591) | 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 3) | 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 5) | 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 10) | 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 46364 a prime number?
No. 46364 = × 67 × 173, so it is divisible by 2.
What are the factors of 46364?
1, 2, 4, 67, 134, 173, 268, 346, 692, 11591, 23182, 46364.
What is 46364 in binary?
1011010100011100 (hexadecimal B51C, octal 132434).
What is the square root of 46364?
About 215.3230, exactly 2√11591.
Is 46364 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 46364?
46364 is a palindrome: it reads 46364 backwards too.