The number 29950
29950 is a composite number with 12 divisors. Its prime factorisation is 2 × × 599. Divisors (12): 1, 2, 5, 10, 25, 50, 599, 1198, 2995, 5990, 14975, 29950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29950: a Harshad number: divisible by its digit sum 25.
- 2
29950 is composite. Its prime factorisation is
- 3
The divisors add up to 55800; without 29950 itself that is 25850, so 29950 is deficient (25850 is less than 29950). Euler's totient φ(29950) = 11960 numbers up to 29950 share no factor with it.
- 4
The digits of 29950 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29950 = 2 \times 5^{2} \times 599 \]29950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 55800 |
| Euler totient φ(n) | 11960 |
| Square | 897002500 |
| Cube | 26865224875000 |
| Square root | 173.060683 (= 5√1198) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.995 × |
29950 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand nine hundred and fifty |
| Binary (base 2) | 111010011111110 |
| Octal (base 8) | 72376 |
| Hexadecimal (base 16) | 74FE |
| Base 3 | 1112002021 |
| As time | 29950 seconds = 8 h 19 min 10 s |
Is 29950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (29950 ÷ 2 = 14975) | 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 | Yes (29950 ÷ 5 = 5990) | 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 4) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (29950 ÷ 10 = 2995) | 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 29950 a prime number?
No. 29950 = 2 × × 599, so it is divisible by 2.
What are the factors of 29950?
1, 2, 5, 10, 25, 50, 599, 1198, 2995, 5990, 14975, 29950.
What is 29950 in binary?
111010011111110 (hexadecimal 74FE, octal 72376).
What is the square root of 29950?
About 173.0607, exactly 5√1198.
Is 29950 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 29950?
29950 is a Harshad number: divisible by its digit sum 25.