The number 29951
29951 is a composite number with 4 divisors. Its prime factorisation is 61 × 491. Divisors (4): 1, 61, 491, 29951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 29951: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 491, the product of two primes.
- 2
29951 is composite. Its prime factorisation is
- 3
The divisors add up to 30504; without 29951 itself that is 553, so 29951 is deficient (553 is less than 29951). Euler's totient φ(29951) = 29400 numbers up to 29951 share no factor with it.
- 4
The digits of 29951 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 29951 = 61 \times 491 \]
29951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 30504 |
| Euler totient φ(n) | 29400 |
| Square | 897062401 |
| Cube | 26867915972351 |
| Square root | 173.063572 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.9951 × |
29951 in other forms
| Form | Value |
|---|---|
| In words | twenty-nine thousand nine hundred and fifty-one |
| Binary (base 2) | 111010011111111 |
| Octal (base 8) | 72377 |
| Hexadecimal (base 16) | 74FF |
| Base 3 | 1112002022 |
| As time | 29951 seconds = 8 h 19 min 11 s |
Is 29951 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 29951 a prime number?
No. 29951 = 61 × 491, so it is divisible by 61.
What are the factors of 29951?
1, 61, 491, 29951.
What is 29951 in binary?
111010011111111 (hexadecimal 74FF, octal 72377).
What is the square root of 29951?
About 173.0636.
Is 29951 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 29951?
29951 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 491, the product of two primes.