The number 3902
3902 is a composite number with 4 divisors. Its prime factorisation is 2 × 1951. Divisors (4): 1, 2, 1951, 3902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3902: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 1951, the product of two primes.
- 2
3902 is composite. Its prime factorisation is
- 3
The divisors add up to 5856; without 3902 itself that is 1954, so 3902 is deficient (1954 is less than 3902). Euler's totient φ(3902) = 1950 numbers up to 3902 share no factor with it.
- 4
The digits of 3902 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 175 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3902 = 2 \times 1951 \]
3902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5856 |
| Euler totient φ(n) | 1950 |
| Square | 15225604 |
| Cube | 59410306808 |
| Square root | 62.465991 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 175 |
| Scientific notation | 3.902 × |
3902 in other forms
| Form | Value |
|---|---|
| In words | three thousand nine hundred and two |
| Roman numerals | MMMCMII |
| Binary (base 2) | 111100111110 |
| Octal (base 8) | 7476 |
| Hexadecimal (base 16) | F3E |
| Base 3 | 12100112 |
| As time | 3902 seconds = 1 h 5 min 2 s |
Is 3902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (3902 ÷ 2 = 1951) | 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 2) | 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 3) | 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 5) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3902 a prime number?
No. 3902 = 2 × 1951, so it is divisible by 2.
What are the factors of 3902?
1, 2, 1951, 3902.
What is 3902 in binary?
111100111110 (hexadecimal F3E, octal 7476).
What is the square root of 3902?
About 62.4660.
What is 3902 in Roman numerals?
MMMCMII.
Is 3902 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 3902?
3902 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 1951, the product of two primes.