The number 80913
80913 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 3853. Divisors (8): 1, 3, 7, 21, 3853, 11559, 26971, 80913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80913: a Harshad number: divisible by its digit sum 21.
- 2
80913 is composite. Its prime factorisation is
- 3
The divisors add up to 123328; without 80913 itself that is 42415, so 80913 is deficient (42415 is less than 80913). Euler's totient φ(80913) = 46224 numbers up to 80913 share no factor with it.
- 4
The digits of 80913 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 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80913 = 3 \times 7 \times 3853 \]
80913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 123328 |
| Euler totient φ(n) | 46224 |
| Square | 6546913569 |
| Cube | 529730417608497 |
| Square root | 284.452105 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.0913 × |
80913 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand nine hundred and thirteen |
| Binary (base 2) | 10011110000010001 |
| Octal (base 8) | 236021 |
| Hexadecimal (base 16) | 13C11 |
| Base 3 | 11002222210 |
| As time | 80913 seconds = 22 h 28 min 33 s |
Is 80913 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 | Yes (80913 ÷ 3 = 26971) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (80913 ÷ 7 = 11559) | 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 1) | 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 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80913 a prime number?
No. 80913 = 3 × 7 × 3853, so it is divisible by 3.
What are the factors of 80913?
1, 3, 7, 21, 3853, 11559, 26971, 80913.
What is 80913 in binary?
10011110000010001 (hexadecimal 13C11, octal 236021).
What is the square root of 80913?
About 284.4521.
Is 80913 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 80913?
80913 is a Harshad number: divisible by its digit sum 21.