The number 46396
46396 is a composite number with 12 divisors. Its prime factorisation is × 7 × 1657. Divisors (12): 1, 2, 4, 7, 14, 28, 1657, 3314, 6628, 11599, 23198, 46396.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46396: a Harshad number: divisible by its digit sum 28.
- 2
46396 is composite. Its prime factorisation is
- 3
The divisors add up to 92848; without 46396 itself that is 46452, so 46396 is abundant (46452 is more than 46396). Euler's totient φ(46396) = 19872 numbers up to 46396 share no factor with it.
- 4
The digits of 46396 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 207 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46396 = 2^{2} \times 7 \times 1657 \]46396 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 92848 |
| Euler totient φ(n) | 19872 |
| Square | 2152588816 |
| Cube | 99871510707136 |
| Square root | 215.397307 (= 2√11599) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 207 |
| Scientific notation | 4.6396 × |
46396 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand three hundred and ninety-six |
| Binary (base 2) | 1011010100111100 |
| Octal (base 8) | 132474 |
| Hexadecimal (base 16) | B53C |
| Base 3 | 2100122101 |
| As time | 46396 seconds = 12 h 53 min 16 s |
Is 46396 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46396 ÷ 2 = 23198) | 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 (46396 ÷ 4 = 11599) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (46396 ÷ 7 = 6628) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46396 a prime number?
No. 46396 = × 7 × 1657, so it is divisible by 2.
What are the factors of 46396?
1, 2, 4, 7, 14, 28, 1657, 3314, 6628, 11599, 23198, 46396.
What is 46396 in binary?
1011010100111100 (hexadecimal B53C, octal 132474).
What is the square root of 46396?
About 215.3973, exactly 2√11599.
Is 46396 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 46396?
46396 is a Harshad number: divisible by its digit sum 28.