The number 30913
30913 is a composite number with 4 divisors. Its prime factorisation is 19 × 1627. Divisors (4): 1, 19, 1627, 30913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30913: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 19 × 1627, the product of two primes.
- 2
30913 is composite. Its prime factorisation is
- 3
The divisors add up to 32560; without 30913 itself that is 1647, so 30913 is deficient (1647 is less than 30913). Euler's totient φ(30913) = 29268 numbers up to 30913 share no factor with it.
- 4
The digits of 30913 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 191 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30913 = 19 \times 1627 \]
30913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 32560 |
| Euler totient φ(n) | 29268 |
| Square | 955613569 |
| Cube | 29540882258497 |
| Square root | 175.820932 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 191 |
| Scientific notation | 3.0913 × |
30913 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand nine hundred and thirteen |
| Binary (base 2) | 111100011000001 |
| Octal (base 8) | 74301 |
| Hexadecimal (base 16) | 78C1 |
| Base 3 | 1120101221 |
| As time | 30913 seconds = 8 h 35 min 13 s |
Is 30913 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 1) | 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 1) | 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 1) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30913 a prime number?
No. 30913 = 19 × 1627, so it is divisible by 19.
What are the factors of 30913?
1, 19, 1627, 30913.
What is 30913 in binary?
111100011000001 (hexadecimal 78C1, octal 74301).
What is the square root of 30913?
About 175.8209.
Is 30913 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 30913?
30913 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 19 × 1627, the product of two primes.