The number 7950
7950 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 53. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 53, 75, 106, 150, 159, 265 … 7950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
7950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
7950 is composite. Its prime factorisation is
- 3
The divisors add up to 20088; without 7950 itself that is 12138, so 7950 is abundant (12138 is more than 7950). Euler's totient φ(7950) = 2080 numbers up to 7950 share no factor with it.
- 4
The digits of 7950 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 7950 = 2 \times 3 \times 5^{2} \times 53 \]7950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 20088 |
| Euler totient φ(n) | 2080 |
| Square | 63202500 |
| Cube | 502459875000 |
| Square root | 89.162773 (= 5√318) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 52 |
| Scientific notation | 7.95 × |
7950 in other forms
| Form | Value |
|---|---|
| In words | seven thousand nine hundred and fifty |
| Binary (base 2) | 1111100001110 |
| Octal (base 8) | 17416 |
| Hexadecimal (base 16) | 1F0E |
| Base 3 | 101220110 |
| As time | 7950 seconds = 2 h 12 min 30 s |
Is 7950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (7950 ÷ 2 = 3975) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (7950 ÷ 3 = 2650) | 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 (7950 ÷ 5 = 1590) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (7950 ÷ 6 = 1325) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (7950 ÷ 10 = 795) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 7950 a prime number?
No. 7950 = 2 × 3 × × 53, so it is divisible by 2.
What are the factors of 7950?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 53, 75, 106, 150, 159, 265, 318, 530, 795, 1325, 1590, 2650, 3975, 7950.
What is 7950 in binary?
1111100001110 (hexadecimal 1F0E, octal 17416).
What is the square root of 7950?
About 89.1628, exactly 5√318.
Is 7950 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 7950?
It is a composite number with 24 divisors.