The number 80330
80330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 29 × 277. Divisors (16): 1, 2, 5, 10, 29, 58, 145, 277, 290, 554, 1385, 2770, 8033, 16066, 40165, 80330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80330: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
80330 is composite. Its prime factorisation is
- 3
The divisors add up to 150120; without 80330 itself that is 69790, so 80330 is deficient (69790 is less than 80330). Euler's totient φ(80330) = 30912 numbers up to 80330 share no factor with it.
- 4
The digits of 80330 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80330 = 2 \times 5 \times 29 \times 277 \]
80330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 150120 |
| Euler totient φ(n) | 30912 |
| Square | 6452908900 |
| Cube | 518362171937000 |
| Square root | 283.425475 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 68 |
| Scientific notation | 8.033 × |
80330 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand three hundred and thirty |
| Binary (base 2) | 10011100111001010 |
| Octal (base 8) | 234712 |
| Hexadecimal (base 16) | 139CA |
| Base 3 | 11002012012 |
| As time | 80330 seconds = 22 h 18 min 50 s |
Is 80330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80330 ÷ 2 = 40165) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (80330 ÷ 5 = 16066) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (80330 ÷ 10 = 8033) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80330 a prime number?
No. 80330 = 2 × 5 × 29 × 277, so it is divisible by 2.
What are the factors of 80330?
1, 2, 5, 10, 29, 58, 145, 277, 290, 554, 1385, 2770, 8033, 16066, 40165, 80330.
What is 80330 in binary?
10011100111001010 (hexadecimal 139CA, octal 234712).
What is the square root of 80330?
About 283.4255.
Is 80330 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 80330?
80330 is a happy number: repeatedly adding the squares of its digits reaches 1.