The number 30351
30351 is a composite number with 8 divisors. Its prime factorisation is 3 × 67 × 151. Divisors (8): 1, 3, 67, 151, 201, 453, 10117, 30351.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30351: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
30351 is composite. Its prime factorisation is
- 3
The divisors add up to 41344; without 30351 itself that is 10993, so 30351 is deficient (10993 is less than 30351). Euler's totient φ(30351) = 19800 numbers up to 30351 share no factor with it.
- 4
The digits of 30351 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 209 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30351 = 3 \times 67 \times 151 \]
30351 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 41344 |
| Euler totient φ(n) | 19800 |
| Square | 921183201 |
| Cube | 27958831333551 |
| Square root | 174.215384 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 209 |
| Scientific notation | 3.0351 × |
30351 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand three hundred and fifty-one |
| Binary (base 2) | 111011010001111 |
| Octal (base 8) | 73217 |
| Hexadecimal (base 16) | 768F |
| Base 3 | 1112122010 |
| As time | 30351 seconds = 8 h 25 min 51 s |
Is 30351 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 (30351 ÷ 3 = 10117) | 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 | 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 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 2) | 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 30351 a prime number?
No. 30351 = 3 × 67 × 151, so it is divisible by 3.
What are the factors of 30351?
1, 3, 67, 151, 201, 453, 10117, 30351.
What is 30351 in binary?
111011010001111 (hexadecimal 768F, octal 73217).
What is the square root of 30351?
About 174.2154.
Is 30351 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 30351?
30351 is a happy number: repeatedly adding the squares of its digits reaches 1.