The number 80507
80507 is a composite number with 12 divisors. Its prime factorisation is × 31 × 53. Divisors (12): 1, 7, 31, 49, 53, 217, 371, 1519, 1643, 2597, 11501, 80507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80507 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80507 is composite. Its prime factorisation is
- 3
The divisors add up to 98496; without 80507 itself that is 17989, so 80507 is deficient (17989 is less than 80507). Euler's totient φ(80507) = 65520 numbers up to 80507 share no factor with it.
- 4
The digits of 80507 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80507 = 7^{2} \times 31 \times 53 \]80507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 98496 |
| Euler totient φ(n) | 65520 |
| Square | 6481377049 |
| Cube | 521796222083843 |
| Square root | 283.737555 (= 7√1643) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 120 |
| Scientific notation | 8.0507 × |
80507 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand five hundred and seven |
| Binary (base 2) | 10011101001111011 |
| Octal (base 8) | 235173 |
| Hexadecimal (base 16) | 13A7B |
| Base 3 | 11002102202 |
| As time | 80507 seconds = 22 h 21 min 47 s |
Is 80507 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (80507 ÷ 7 = 11501) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80507 a prime number?
No. 80507 = × 31 × 53, so it is divisible by 7.
What are the factors of 80507?
1, 7, 31, 49, 53, 217, 371, 1519, 1643, 2597, 11501, 80507.
What is 80507 in binary?
10011101001111011 (hexadecimal 13A7B, octal 235173).
What is the square root of 80507?
About 283.7376, exactly 7√1643.
Is 80507 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 80507?
It is a composite number with 12 divisors.