The number 80470
80470 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 619. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 130, 619, 1238, 3095, 6190, 8047, 16094, 40235, 80470.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80470: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
80470 is composite. Its prime factorisation is
- 3
The divisors add up to 156240; without 80470 itself that is 75770, so 80470 is deficient (75770 is less than 80470). Euler's totient φ(80470) = 29664 numbers up to 80470 share no factor with it.
- 4
The digits of 80470 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80470 = 2 \times 5 \times 13 \times 619 \]
80470 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 156240 |
| Euler totient φ(n) | 29664 |
| Square | 6475420900 |
| Cube | 521077119823000 |
| Square root | 283.672346 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.047 × |
80470 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand four hundred and seventy |
| Binary (base 2) | 10011101001010110 |
| Octal (base 8) | 235126 |
| Hexadecimal (base 16) | 13A56 |
| Base 3 | 11002101101 |
| As time | 80470 seconds = 22 h 21 min 10 s |
Is 80470 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80470 ÷ 2 = 40235) | 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 (80470 ÷ 5 = 16094) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (80470 ÷ 10 = 8047) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80470 a prime number?
No. 80470 = 2 × 5 × 13 × 619, so it is divisible by 2.
What are the factors of 80470?
1, 2, 5, 10, 13, 26, 65, 130, 619, 1238, 3095, 6190, 8047, 16094, 40235, 80470.
What is 80470 in binary?
10011101001010110 (hexadecimal 13A56, octal 235126).
What is the square root of 80470?
About 283.6723.
Is 80470 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 80470?
80470 is a happy number: repeatedly adding the squares of its digits reaches 1.