The number 28951
28951 is a composite number with 8 divisors. Its prime factorisation is 13 × 17 × 131. Divisors (8): 1, 13, 17, 131, 221, 1703, 2227, 28951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
28951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
28951 is composite. Its prime factorisation is
- 3
The divisors add up to 33264; without 28951 itself that is 4313, so 28951 is deficient (4313 is less than 28951). Euler's totient φ(28951) = 24960 numbers up to 28951 share no factor with it.
- 4
The digits of 28951 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
\[ 28951 = 13 \times 17 \times 131 \]
28951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 33264 |
| Euler totient φ(n) | 24960 |
| Square | 838160401 |
| Cube | 24265581769351 |
| Square root | 170.149934 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 165 |
| Scientific notation | 2.8951 × |
28951 in other forms
| Form | Value |
|---|---|
| In words | twenty-eight thousand nine hundred and fifty-one |
| Binary (base 2) | 111000100010111 |
| Octal (base 8) | 70427 |
| Hexadecimal (base 16) | 7117 |
| Base 3 | 1110201021 |
| As time | 28951 seconds = 8 h 2 min 31 s |
Is 28951 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 7) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 28951 a prime number?
No. 28951 = 13 × 17 × 131, so it is divisible by 13.
What are the factors of 28951?
1, 13, 17, 131, 221, 1703, 2227, 28951.
What is 28951 in binary?
111000100010111 (hexadecimal 7117, octal 70427).
What is the square root of 28951?
About 170.1499.
Is 28951 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 28951?
It is a composite number with 8 divisors.