The number 30901
30901 is a composite number with 4 divisors. Its prime factorisation is 13 × 2377. Divisors (4): 1, 13, 2377, 30901.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30901: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 2377, the product of two primes.
- 2
30901 is composite. Its prime factorisation is
- 3
The divisors add up to 33292; without 30901 itself that is 2391, so 30901 is deficient (2391 is less than 30901). Euler's totient φ(30901) = 28512 numbers up to 30901 share no factor with it.
- 4
The digits of 30901 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30901 = 13 \times 2377 \]
30901 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 33292 |
| Euler totient φ(n) | 28512 |
| Square | 954871801 |
| Cube | 29506493522701 |
| Square root | 175.786803 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 147 |
| Scientific notation | 3.0901 × |
30901 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand nine hundred and one |
| Binary (base 2) | 111100010110101 |
| Octal (base 8) | 74265 |
| Hexadecimal (base 16) | 78B5 |
| Base 3 | 1120101111 |
| As time | 30901 seconds = 8 h 35 min 1 s |
Is 30901 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 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 2) | 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 30901 a prime number?
No. 30901 = 13 × 2377, so it is divisible by 13.
What are the factors of 30901?
1, 13, 2377, 30901.
What is 30901 in binary?
111100010110101 (hexadecimal 78B5, octal 74265).
What is the square root of 30901?
About 175.7868.
Is 30901 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 30901?
30901 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 2377, the product of two primes.