The number 47902
47902 is a composite number with 8 divisors. Its prime factorisation is 2 × 43 × 557. Divisors (8): 1, 2, 43, 86, 557, 1114, 23951, 47902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
47902 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
47902 is composite. Its prime factorisation is
- 3
The divisors add up to 73656; without 47902 itself that is 25754, so 47902 is deficient (25754 is less than 47902). Euler's totient φ(47902) = 23352 numbers up to 47902 share no factor with it.
- 4
The digits of 47902 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 47902 = 2 \times 43 \times 557 \]
47902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 73656 |
| Euler totient φ(n) | 23352 |
| Square | 2294601604 |
| Cube | 109916006034808 |
| Square root | 218.865255 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.7902 × |
47902 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and two |
| Binary (base 2) | 1011101100011110 |
| Octal (base 8) | 135436 |
| Hexadecimal (base 16) | BB1E |
| Base 3 | 2102201011 |
| As time | 47902 seconds = 13 h 18 min 22 s |
Is 47902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (47902 ÷ 2 = 23951) | 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 2) | 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 1) | 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 4) | 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 8) | 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 47902 a prime number?
No. 47902 = 2 × 43 × 557, so it is divisible by 2.
What are the factors of 47902?
1, 2, 43, 86, 557, 1114, 23951, 47902.
What is 47902 in binary?
1011101100011110 (hexadecimal BB1E, octal 135436).
What is the square root of 47902?
About 218.8653.
Is 47902 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 47902?
It is a composite number with 8 divisors.