The number 83330
83330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 641. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 130, 641, 1282, 3205, 6410, 8333, 16666, 41665, 83330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 83330: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
83330 is composite. Its prime factorisation is
- 3
The divisors add up to 161784; without 83330 itself that is 78454, so 83330 is deficient (78454 is less than 83330). Euler's totient φ(83330) = 30720 numbers up to 83330 share no factor with it.
- 4
The digits of 83330 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83330 = 2 \times 5 \times 13 \times 641 \]
83330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 161784 |
| Euler totient φ(n) | 30720 |
| Square | 6943888900 |
| Cube | 578634262037000 |
| Square root | 288.669361 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 107 |
| Scientific notation | 8.333 × |
83330 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand three hundred and thirty |
| Binary (base 2) | 10100010110000010 |
| Octal (base 8) | 242602 |
| Hexadecimal (base 16) | 14582 |
| Base 3 | 11020022022 |
| As time | 83330 seconds = 23 h 8 min 50 s |
Is 83330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83330 ÷ 2 = 41665) | 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 (83330 ÷ 5 = 16666) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (83330 ÷ 10 = 8333) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 83330 a prime number?
No. 83330 = 2 × 5 × 13 × 641, so it is divisible by 2.
What are the factors of 83330?
1, 2, 5, 10, 13, 26, 65, 130, 641, 1282, 3205, 6410, 8333, 16666, 41665, 83330.
What is 83330 in binary?
10100010110000010 (hexadecimal 14582, octal 242602).
What is the square root of 83330?
About 288.6694.
Is 83330 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 83330?
83330 is a happy number: repeatedly adding the squares of its digits reaches 1.