The number 46958
46958 is a composite number with 8 divisors. Its prime factorisation is 2 × 53 × 443. Divisors (8): 1, 2, 53, 106, 443, 886, 23479, 46958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46958 is composite. Its prime factorisation is
- 3
The divisors add up to 71928; without 46958 itself that is 24970, so 46958 is deficient (24970 is less than 46958). Euler's totient φ(46958) = 22984 numbers up to 46958 share no factor with it.
- 4
The digits of 46958 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46958 = 2 \times 53 \times 443 \]
46958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71928 |
| Euler totient φ(n) | 22984 |
| Square | 2205053764 |
| Cube | 103544914649912 |
| Square root | 216.697946 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.6958 × |
46958 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and fifty-eight |
| Binary (base 2) | 1011011101101110 |
| Octal (base 8) | 133556 |
| Hexadecimal (base 16) | B76E |
| Base 3 | 2101102012 |
| As time | 46958 seconds = 13 h 2 min 38 s |
Is 46958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46958 ÷ 2 = 23479) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 2) | 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 6) | 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 8) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46958 a prime number?
No. 46958 = 2 × 53 × 443, so it is divisible by 2.
What are the factors of 46958?
1, 2, 53, 106, 443, 886, 23479, 46958.
What is 46958 in binary?
1011011101101110 (hexadecimal B76E, octal 133556).
What is the square root of 46958?
About 216.6979.
Is 46958 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 46958?
It is a composite number with 8 divisors.