The number 30823
30823 is a composite number with 4 divisors. Its prime factorisation is 13 × 2371. Divisors (4): 1, 13, 2371, 30823.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30823: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 2371, the product of two primes.
- 2
30823 is composite. Its prime factorisation is
- 3
The divisors add up to 33208; without 30823 itself that is 2385, so 30823 is deficient (2385 is less than 30823). Euler's totient φ(30823) = 28440 numbers up to 30823 share no factor with it.
- 4
The digits of 30823 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 209 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30823 = 13 \times 2371 \]
30823 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 33208 |
| Euler totient φ(n) | 28440 |
| Square | 950057329 |
| Cube | 29283617051767 |
| Square root | 175.564803 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 209 |
| Scientific notation | 3.0823 × |
30823 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand eight hundred and twenty-three |
| Binary (base 2) | 111100001100111 |
| Octal (base 8) | 74147 |
| Hexadecimal (base 16) | 7867 |
| Base 3 | 1120021121 |
| As time | 30823 seconds = 8 h 33 min 43 s |
Is 30823 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 3) | 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 2) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 30823 a prime number?
No. 30823 = 13 × 2371, so it is divisible by 13.
What are the factors of 30823?
1, 13, 2371, 30823.
What is 30823 in binary?
111100001100111 (hexadecimal 7867, octal 74147).
What is the square root of 30823?
About 175.5648.
Is 30823 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 30823?
30823 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 2371, the product of two primes.