The number 81469
81469 is a composite number with 4 divisors. Its prime factorisation is 257 × 317. Divisors (4): 1, 257, 317, 81469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81469: a semiprime: 257 × 317, the product of two primes.
- 2
81469 is composite. Its prime factorisation is
- 3
The divisors add up to 82044; without 81469 itself that is 575, so 81469 is deficient (575 is less than 81469). Euler's totient φ(81469) = 80896 numbers up to 81469 share no factor with it.
- 4
The digits of 81469 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81469 = 257 \times 317 \]
81469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 82044 |
| Euler totient φ(n) | 80896 |
| Square | 6637197961 |
| Cube | 540725880684709 |
| Square root | 285.427749 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.1469 × |
81469 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and sixty-nine |
| Binary (base 2) | 10011111000111101 |
| Octal (base 8) | 237075 |
| Hexadecimal (base 16) | 13E3D |
| Base 3 | 11010202101 |
| As time | 81469 seconds = 22 h 37 min 49 s |
Is 81469 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 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 1) | 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 5) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81469 a prime number?
No. 81469 = 257 × 317, so it is divisible by 257.
What are the factors of 81469?
1, 257, 317, 81469.
What is 81469 in binary?
10011111000111101 (hexadecimal 13E3D, octal 237075).
What is the square root of 81469?
About 285.4277.
Is 81469 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 81469?
81469 is a semiprime: 257 × 317, the product of two primes.