The number 46962
46962 is a composite number with 12 divisors. Its prime factorisation is 2 × × 2609. Divisors (12): 1, 2, 3, 6, 9, 18, 2609, 5218, 7827, 15654, 23481, 46962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46962 is composite. Its prime factorisation is
- 3
The divisors add up to 101790; without 46962 itself that is 54828, so 46962 is abundant (54828 is more than 46962). Euler's totient φ(46962) = 15648 numbers up to 46962 share no factor with it.
- 4
The digits of 46962 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46962 = 2 \times 3^{2} \times 2609 \]46962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 101790 |
| Euler totient φ(n) | 15648 |
| Square | 2205429444 |
| Cube | 103571377549128 |
| Square root | 216.707176 (= 3√5218) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.6962 × |
46962 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and sixty-two |
| Binary (base 2) | 1011011101110010 |
| Octal (base 8) | 133562 |
| Hexadecimal (base 16) | B772 |
| Base 3 | 2101102100 |
| As time | 46962 seconds = 13 h 2 min 42 s |
Is 46962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46962 ÷ 2 = 23481) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (46962 ÷ 3 = 15654) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (46962 ÷ 6 = 7827) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (46962 ÷ 9 = 5218) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46962 a prime number?
No. 46962 = 2 × × 2609, so it is divisible by 2.
What are the factors of 46962?
1, 2, 3, 6, 9, 18, 2609, 5218, 7827, 15654, 23481, 46962.
What is 46962 in binary?
1011011101110010 (hexadecimal B772, octal 133562).
What is the square root of 46962?
About 216.7072, exactly 3√5218.
Is 46962 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 46962?
It is a composite number with 12 divisors.