The number 46432
46432 is a composite number with 12 divisors. Its prime factorisation is × 1451. Divisors (12): 1, 2, 4, 8, 16, 32, 1451, 2902, 5804, 11608, 23216, 46432.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46432 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46432 is composite. Its prime factorisation is
- 3
The divisors add up to 91476; without 46432 itself that is 45044, so 46432 is deficient (45044 is less than 46432). Euler's totient φ(46432) = 23200 numbers up to 46432 share no factor with it.
- 4
The digits of 46432 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46432 = 2^{5} \times 1451 \]46432 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91476 |
| Euler totient φ(n) | 23200 |
| Square | 2155930624 |
| Cube | 100104170733568 |
| Square root | 215.480858 (= 4√2902) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6432 × |
46432 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand four hundred and thirty-two |
| Binary (base 2) | 1011010101100000 |
| Octal (base 8) | 132540 |
| Hexadecimal (base 16) | B560 |
| Base 3 | 2100200201 |
| As time | 46432 seconds = 12 h 53 min 52 s |
Is 46432 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46432 ÷ 2 = 23216) | 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 (46432 ÷ 4 = 11608) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 1) | 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 (46432 ÷ 8 = 5804) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 46432 a prime number?
No. 46432 = × 1451, so it is divisible by 2.
What are the factors of 46432?
1, 2, 4, 8, 16, 32, 1451, 2902, 5804, 11608, 23216, 46432.
What is 46432 in binary?
1011010101100000 (hexadecimal B560, octal 132540).
What is the square root of 46432?
About 215.4809, exactly 4√2902.
Is 46432 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 46432?
It is a composite number with 12 divisors.