The number 81476
81476 is a composite number with 6 divisors. Its prime factorisation is × 20369. Divisors (6): 1, 2, 4, 20369, 40738, 81476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81476 is composite. Its prime factorisation is
- 3
The divisors add up to 142590; without 81476 itself that is 61114, so 81476 is deficient (61114 is less than 81476). Euler's totient φ(81476) = 40736 numbers up to 81476 share no factor with it.
- 4
The digits of 81476 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81476 = 2^{2} \times 20369 \]81476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 142590 |
| Euler totient φ(n) | 40736 |
| Square | 6638338576 |
| Cube | 540865273818176 |
| Square root | 285.440011 (= 2√20369) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 37 |
| Scientific notation | 8.1476 × |
81476 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and seventy-six |
| Binary (base 2) | 10011111001000100 |
| Octal (base 8) | 237104 |
| Hexadecimal (base 16) | 13E44 |
| Base 3 | 11010202122 |
| As time | 81476 seconds = 22 h 37 min 56 s |
Is 81476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81476 ÷ 2 = 40738) | 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 | Yes (81476 ÷ 4 = 20369) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81476 a prime number?
No. 81476 = × 20369, so it is divisible by 2.
What are the factors of 81476?
1, 2, 4, 20369, 40738, 81476.
What is 81476 in binary?
10011111001000100 (hexadecimal 13E44, octal 237104).
What is the square root of 81476?
About 285.4400, exactly 2√20369.
Is 81476 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 81476?
It is a composite number with 6 divisors.