The number 30891
30891 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 1471. Divisors (8): 1, 3, 7, 21, 1471, 4413, 10297, 30891.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30891: a Harshad number: divisible by its digit sum 21.
- 2
30891 is composite. Its prime factorisation is
- 3
The divisors add up to 47104; without 30891 itself that is 16213, so 30891 is deficient (16213 is less than 30891). Euler's totient φ(30891) = 17640 numbers up to 30891 share no factor with it.
- 4
The digits of 30891 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 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30891 = 3 \times 7 \times 1471 \]
30891 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 47104 |
| Euler totient φ(n) | 17640 |
| Square | 954253881 |
| Cube | 29477856637971 |
| Square root | 175.758357 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 59 |
| Scientific notation | 3.0891 × |
30891 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand eight hundred and ninety-one |
| Binary (base 2) | 111100010101011 |
| Octal (base 8) | 74253 |
| Hexadecimal (base 16) | 78AB |
| Base 3 | 1120101010 |
| As time | 30891 seconds = 8 h 34 min 51 s |
Is 30891 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 | Yes (30891 ÷ 3 = 10297) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (30891 ÷ 7 = 4413) | 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 3) | 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 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30891 a prime number?
No. 30891 = 3 × 7 × 1471, so it is divisible by 3.
What are the factors of 30891?
1, 3, 7, 21, 1471, 4413, 10297, 30891.
What is 30891 in binary?
111100010101011 (hexadecimal 78AB, octal 74253).
What is the square root of 30891?
About 175.7584.
Is 30891 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 30891?
30891 is a Harshad number: divisible by its digit sum 21.