The number 46902
46902 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 7817. Divisors (8): 1, 2, 3, 6, 7817, 15634, 23451, 46902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46902 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46902 is composite. Its prime factorisation is
- 3
The divisors add up to 93816; without 46902 itself that is 46914, so 46902 is abundant (46914 is more than 46902). Euler's totient φ(46902) = 15632 numbers up to 46902 share no factor with it.
- 4
The digits of 46902 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46902 = 2 \times 3 \times 7817 \]
46902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 93816 |
| Euler totient φ(n) | 15632 |
| Square | 2199797604 |
| Cube | 103174907222808 |
| Square root | 216.568696 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.6902 × |
46902 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and two |
| Binary (base 2) | 1011011100110110 |
| Octal (base 8) | 133466 |
| Hexadecimal (base 16) | B736 |
| Base 3 | 2101100010 |
| As time | 46902 seconds = 13 h 1 min 42 s |
Is 46902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46902 ÷ 2 = 23451) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (46902 ÷ 3 = 15634) | 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 (46902 ÷ 6 = 7817) | 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 3) | 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 9) | 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 46902 a prime number?
No. 46902 = 2 × 3 × 7817, so it is divisible by 2.
What are the factors of 46902?
1, 2, 3, 6, 7817, 15634, 23451, 46902.
What is 46902 in binary?
1011011100110110 (hexadecimal B736, octal 133466).
What is the square root of 46902?
About 216.5687.
Is 46902 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 46902?
It is a composite number with 8 divisors.