The number 80299
80299 is a composite number with 4 divisors. Its prime factorisation is 59 × 1361. Divisors (4): 1, 59, 1361, 80299.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80299: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 59 × 1361, the product of two primes.
- 2
80299 is composite. Its prime factorisation is
- 3
The divisors add up to 81720; without 80299 itself that is 1421, so 80299 is deficient (1421 is less than 80299). Euler's totient φ(80299) = 78880 numbers up to 80299 share no factor with it.
- 4
The digits of 80299 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 288 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80299 = 59 \times 1361 \]
80299 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 81720 |
| Euler totient φ(n) | 78880 |
| Square | 6447929401 |
| Cube | 517762282970899 |
| Square root | 283.370782 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 288 |
| Scientific notation | 8.0299 × |
80299 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand two hundred and ninety-nine |
| Binary (base 2) | 10011100110101011 |
| Octal (base 8) | 234653 |
| Hexadecimal (base 16) | 139AB |
| Base 3 | 11002011001 |
| As time | 80299 seconds = 22 h 18 min 19 s |
Is 80299 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 1) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80299 a prime number?
No. 80299 = 59 × 1361, so it is divisible by 59.
What are the factors of 80299?
1, 59, 1361, 80299.
What is 80299 in binary?
10011100110101011 (hexadecimal 139AB, octal 234653).
What is the square root of 80299?
About 283.3708.
Is 80299 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 80299?
80299 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 59 × 1361, the product of two primes.