The number 80469
80469 is a composite number with 6 divisors. Its prime factorisation is × 8941. Divisors (6): 1, 3, 9, 8941, 26823, 80469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80469 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80469 is composite. Its prime factorisation is
- 3
The divisors add up to 116246; without 80469 itself that is 35777, so 80469 is deficient (35777 is less than 80469). Euler's totient φ(80469) = 53640 numbers up to 80469 share no factor with it.
- 4
The digits of 80469 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80469 = 3^{2} \times 8941 \]80469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 116246 |
| Euler totient φ(n) | 53640 |
| Square | 6475259961 |
| Cube | 521057693801709 |
| Square root | 283.670584 (= 3√8941) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 45 |
| Scientific notation | 8.0469 × |
80469 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand four hundred and sixty-nine |
| Binary (base 2) | 10011101001010101 |
| Octal (base 8) | 235125 |
| Hexadecimal (base 16) | 13A55 |
| Base 3 | 11002101100 |
| As time | 80469 seconds = 22 h 21 min 9 s |
Is 80469 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 (80469 ÷ 3 = 26823) | 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 4) | 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 | No (remainder 4) | 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 | Yes (80469 ÷ 9 = 8941) | 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 4) | 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 80469 a prime number?
No. 80469 = × 8941, so it is divisible by 3.
What are the factors of 80469?
1, 3, 9, 8941, 26823, 80469.
What is 80469 in binary?
10011101001010101 (hexadecimal 13A55, octal 235125).
What is the square root of 80469?
About 283.6706, exactly 3√8941.
Is 80469 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 80469?
It is a composite number with 6 divisors.