The number 81570
81570 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 2719. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 2719, 5438, 8157, 13595, 16314, 27190, 40785, 81570.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81570: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
81570 is composite. Its prime factorisation is
- 3
The divisors add up to 195840; without 81570 itself that is 114270, so 81570 is abundant (114270 is more than 81570). Euler's totient φ(81570) = 21744 numbers up to 81570 share no factor with it.
- 4
The digits of 81570 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81570 = 2 \times 3 \times 5 \times 2719 \]
81570 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 195840 |
| Euler totient φ(n) | 21744 |
| Square | 6653664900 |
| Cube | 542739445893000 |
| Square root | 285.604622 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.157 × |
81570 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and seventy |
| Binary (base 2) | 10011111010100010 |
| Octal (base 8) | 237242 |
| Hexadecimal (base 16) | 13EA2 |
| Base 3 | 11010220010 |
| As time | 81570 seconds = 22 h 39 min 30 s |
Is 81570 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81570 ÷ 2 = 40785) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (81570 ÷ 3 = 27190) | 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 (81570 ÷ 5 = 16314) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (81570 ÷ 6 = 13595) | 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 2) | 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 | Yes (81570 ÷ 10 = 8157) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81570 a prime number?
No. 81570 = 2 × 3 × 5 × 2719, so it is divisible by 2.
What are the factors of 81570?
1, 2, 3, 5, 6, 10, 15, 30, 2719, 5438, 8157, 13595, 16314, 27190, 40785, 81570.
What is 81570 in binary?
10011111010100010 (hexadecimal 13EA2, octal 237242).
What is the square root of 81570?
About 285.6046.
Is 81570 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 81570?
81570 is a happy number: repeatedly adding the squares of its digits reaches 1.