The number 46934
46934 is a composite number with 8 divisors. Its prime factorisation is 2 × 31 × 757. Divisors (8): 1, 2, 31, 62, 757, 1514, 23467, 46934.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46934 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46934 is composite. Its prime factorisation is
- 3
The divisors add up to 72768; without 46934 itself that is 25834, so 46934 is deficient (25834 is less than 46934). Euler's totient φ(46934) = 22680 numbers up to 46934 share no factor with it.
- 4
The digits of 46934 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46934 = 2 \times 31 \times 757 \]
46934 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72768 |
| Euler totient φ(n) | 22680 |
| Square | 2202800356 |
| Cube | 103386231908504 |
| Square root | 216.642563 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6934 × |
46934 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and thirty-four |
| Binary (base 2) | 1011011101010110 |
| Octal (base 8) | 133526 |
| Hexadecimal (base 16) | B756 |
| Base 3 | 2101101022 |
| As time | 46934 seconds = 13 h 2 min 14 s |
Is 46934 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46934 ÷ 2 = 23467) | 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 4) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46934 a prime number?
No. 46934 = 2 × 31 × 757, so it is divisible by 2.
What are the factors of 46934?
1, 2, 31, 62, 757, 1514, 23467, 46934.
What is 46934 in binary?
1011011101010110 (hexadecimal B756, octal 133526).
What is the square root of 46934?
About 216.6426.
Is 46934 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 46934?
It is a composite number with 8 divisors.