The number 46906
46906 is a composite number with 8 divisors. Its prime factorisation is 2 × 47 × 499. Divisors (8): 1, 2, 47, 94, 499, 998, 23453, 46906.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46906 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46906 is composite. Its prime factorisation is
- 3
The divisors add up to 72000; without 46906 itself that is 25094, so 46906 is deficient (25094 is less than 46906). Euler's totient φ(46906) = 22908 numbers up to 46906 share no factor with it.
- 4
The digits of 46906 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46906 = 2 \times 47 \times 499 \]
46906 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72000 |
| Euler totient φ(n) | 22908 |
| Square | 2200172836 |
| Cube | 103201307045416 |
| Square root | 216.577931 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.6906 × |
46906 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and six |
| Binary (base 2) | 1011011100111010 |
| Octal (base 8) | 133472 |
| Hexadecimal (base 16) | B73A |
| Base 3 | 2101100021 |
| As time | 46906 seconds = 13 h 1 min 46 s |
Is 46906 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46906 ÷ 2 = 23453) | 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 | 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 4) | 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 | No (remainder 7) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46906 a prime number?
No. 46906 = 2 × 47 × 499, so it is divisible by 2.
What are the factors of 46906?
1, 2, 47, 94, 499, 998, 23453, 46906.
What is 46906 in binary?
1011011100111010 (hexadecimal B73A, octal 133472).
What is the square root of 46906?
About 216.5779.
Is 46906 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 46906?
It is a composite number with 8 divisors.