The number 80951
80951 is a composite number with 6 divisors. Its prime factorisation is Ć 479. Divisors (6): 1, 13, 169, 479, 6227, 80951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80951 is composite. Its prime factorisation is
- 3
The divisors add up to 87840; without 80951 itself that is 6889, so 80951 is deficient (6889 is less than 80951). Euler's totient Ļ(80951) = 74568 numbers up to 80951 share no factor with it.
- 4
The digits of 80951 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80951 = 13^{2} \times 479 \]80951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 87840 |
| Euler totient Ļ(n) | 74568 |
| Square | 6553064401 |
| Cube | 530477116325351 |
| Square root | 284.518892 (= 13ā479) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.0951 Ć |
80951 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand nine hundred and fifty-one |
| Binary (base 2) | 10011110000110111 |
| Octal (base 8) | 236067 |
| Hexadecimal (base 16) | 13C37 |
| Base 3 | 11010001012 |
| As time | 80951 seconds = 22 h 29 min 11 s |
Is 80951 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 1) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 80951 a prime number?
No. 80951 = Ć 479, so it is divisible by 13.
What are the factors of 80951?
1, 13, 169, 479, 6227, 80951.
What is 80951 in binary?
10011110000110111 (hexadecimal 13C37, octal 236067).
What is the square root of 80951?
About 284.5189, exactly 13ā479.
Is 80951 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 80951?
It is a composite number with 6 divisors.