The number 3930
3930 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 131. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 131, 262, 393, 655, 786, 1310, 1965, 3930.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3930: a Harshad number: divisible by its digit sum 15.
- 2
3930 is composite. Its prime factorisation is
- 3
The divisors add up to 9504; without 3930 itself that is 5574, so 3930 is abundant (5574 is more than 3930). Euler's totient φ(3930) = 1040 numbers up to 3930 share no factor with it.
- 4
The digits of 3930 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 144 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3930 = 2 \times 3 \times 5 \times 131 \]
3930 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 9504 |
| Euler totient φ(n) | 1040 |
| Square | 15444900 |
| Cube | 60698457000 |
| Square root | 62.689712 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 144 |
| Scientific notation | 3.93 × |
3930 in other forms
| Form | Value |
|---|---|
| In words | three thousand nine hundred and thirty |
| Roman numerals | MMMCMXXX |
| Binary (base 2) | 111101011010 |
| Octal (base 8) | 7532 |
| Hexadecimal (base 16) | F5A |
| Base 3 | 12101120 |
| As time | 3930 seconds = 1 h 5 min 30 s |
Is 3930 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (3930 ÷ 2 = 1965) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (3930 ÷ 3 = 1310) | 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 | Yes (3930 ÷ 5 = 786) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (3930 ÷ 6 = 655) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (3930 ÷ 10 = 393) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 3930 a prime number?
No. 3930 = 2 × 3 × 5 × 131, so it is divisible by 2.
What are the factors of 3930?
1, 2, 3, 5, 6, 10, 15, 30, 131, 262, 393, 655, 786, 1310, 1965, 3930.
What is 3930 in binary?
111101011010 (hexadecimal F5A, octal 7532).
What is the square root of 3930?
About 62.6897.
What is 3930 in Roman numerals?
MMMCMXXX.
Is 3930 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 3930?
3930 is a Harshad number: divisible by its digit sum 15.