The number 80957
80957 is a composite number with 4 divisors. Its prime factorisation is 73 × 1109. Divisors (4): 1, 73, 1109, 80957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80957: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 73 × 1109, the product of two primes.
- 2
80957 is composite. Its prime factorisation is
- 3
The divisors add up to 82140; without 80957 itself that is 1183, so 80957 is deficient (1183 is less than 80957). Euler's totient φ(80957) = 79776 numbers up to 80957 share no factor with it.
- 4
The digits of 80957 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80957 = 73 \times 1109 \]
80957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 82140 |
| Euler totient φ(n) | 79776 |
| Square | 6554035849 |
| Cube | 530595080227493 |
| Square root | 284.529436 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.0957 × |
80957 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand nine hundred and fifty-seven |
| Binary (base 2) | 10011110000111101 |
| Octal (base 8) | 236075 |
| Hexadecimal (base 16) | 13C3D |
| Base 3 | 11010001102 |
| As time | 80957 seconds = 22 h 29 min 17 s |
Is 80957 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 1) | 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 | 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 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80957 a prime number?
No. 80957 = 73 × 1109, so it is divisible by 73.
What are the factors of 80957?
1, 73, 1109, 80957.
What is 80957 in binary?
10011110000111101 (hexadecimal 13C3D, octal 236075).
What is the square root of 80957?
About 284.5294.
Is 80957 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 80957?
80957 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 73 × 1109, the product of two primes.