The number 46946
46946 is a composite number with 4 divisors. Its prime factorisation is 2 × 23473. Divisors (4): 1, 2, 23473, 46946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46946: a semiprime: 2 × 23473, the product of two primes.
- 2
46946 is composite. Its prime factorisation is
- 3
The divisors add up to 70422; without 46946 itself that is 23476, so 46946 is deficient (23476 is less than 46946). Euler's totient φ(46946) = 23472 numbers up to 46946 share no factor with it.
- 4
The digits of 46946 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46946 = 2 \times 23473 \]
46946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70422 |
| Euler totient φ(n) | 23472 |
| Square | 2203926916 |
| Cube | 103465552998536 |
| Square root | 216.670256 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6946 × |
46946 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and forty-six |
| Binary (base 2) | 1011011101100010 |
| Octal (base 8) | 133542 |
| Hexadecimal (base 16) | B762 |
| Base 3 | 2101101202 |
| As time | 46946 seconds = 13 h 2 min 26 s |
Is 46946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46946 ÷ 2 = 23473) | 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 1) | 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 4) | 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 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 46946 a prime number?
No. 46946 = 2 × 23473, so it is divisible by 2.
What are the factors of 46946?
1, 2, 23473, 46946.
What is 46946 in binary?
1011011101100010 (hexadecimal B762, octal 133542).
What is the square root of 46946?
About 216.6703.
Is 46946 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 46946?
46946 is a semiprime: 2 × 23473, the product of two primes.