The number 70330
70330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 541. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 130, 541, 1082, 2705, 5410, 7033, 14066, 35165, 70330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 70330: a Harshad number: divisible by its digit sum 13.
- 2
70330 is composite. Its prime factorisation is
- 3
The divisors add up to 136584; without 70330 itself that is 66254, so 70330 is deficient (66254 is less than 70330). Euler's totient φ(70330) = 25920 numbers up to 70330 share no factor with it.
- 4
The digits of 70330 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 70330 = 2 \times 5 \times 13 \times 541 \]
70330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 136584 |
| Euler totient φ(n) | 25920 |
| Square | 4946308900 |
| Cube | 347873904937000 |
| Square root | 265.198039 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 130 |
| Scientific notation | 7.033 × |
70330 in other forms
| Form | Value |
|---|---|
| In words | seventy thousand three hundred and thirty |
| Binary (base 2) | 10001001010111010 |
| Octal (base 8) | 211272 |
| Hexadecimal (base 16) | 112BA |
| Base 3 | 10120110211 |
| As time | 70330 seconds = 19 h 32 min 10 s |
Is 70330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (70330 ÷ 2 = 35165) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (70330 ÷ 5 = 14066) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | 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 | Yes (70330 ÷ 10 = 7033) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 70330 a prime number?
No. 70330 = 2 × 5 × 13 × 541, so it is divisible by 2.
What are the factors of 70330?
1, 2, 5, 10, 13, 26, 65, 130, 541, 1082, 2705, 5410, 7033, 14066, 35165, 70330.
What is 70330 in binary?
10001001010111010 (hexadecimal 112BA, octal 211272).
What is the square root of 70330?
About 265.1980.
Is 70330 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 70330?
70330 is a Harshad number: divisible by its digit sum 13.