The number 46912
46912 is a composite number with 14 divisors. Its prime factorisation is × 733. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 733, 1466, 2932, 5864, 11728, 23456, 46912.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46912 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46912 is composite. Its prime factorisation is
- 3
The divisors add up to 93218; without 46912 itself that is 46306, so 46912 is deficient (46306 is less than 46912). Euler's totient φ(46912) = 23424 numbers up to 46912 share no factor with it.
- 4
The digits of 46912 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46912 = 2^{6} \times 733 \]46912 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 93218 |
| Euler totient φ(n) | 23424 |
| Square | 2200735744 |
| Cube | 103240915222528 |
| Square root | 216.591782 (= 8√733) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 101 |
| Scientific notation | 4.6912 × |
46912 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and twelve |
| Binary (base 2) | 1011011101000000 |
| Octal (base 8) | 133500 |
| Hexadecimal (base 16) | B740 |
| Base 3 | 2101100111 |
| As time | 46912 seconds = 13 h 1 min 52 s |
Is 46912 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46912 ÷ 2 = 23456) | 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 (46912 ÷ 4 = 11728) | 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 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 | Yes (46912 ÷ 8 = 5864) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 8) | 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 46912 a prime number?
No. 46912 = × 733, so it is divisible by 2.
What are the factors of 46912?
1, 2, 4, 8, 16, 32, 64, 733, 1466, 2932, 5864, 11728, 23456, 46912.
What is 46912 in binary?
1011011101000000 (hexadecimal B740, octal 133500).
What is the square root of 46912?
About 216.5918, exactly 8√733.
Is 46912 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 46912?
It is a composite number with 14 divisors.