The number 81413
81413 is a composite number with 4 divisors. Its prime factorisation is 17 × 4789. Divisors (4): 1, 17, 4789, 81413.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81413: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 4789, the product of two primes.
- 2
81413 is composite. Its prime factorisation is
- 3
The divisors add up to 86220; without 81413 itself that is 4807, so 81413 is deficient (4807 is less than 81413). Euler's totient φ(81413) = 76608 numbers up to 81413 share no factor with it.
- 4
The digits of 81413 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81413 = 17 \times 4789 \]
81413 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 86220 |
| Euler totient φ(n) | 76608 |
| Square | 6628076569 |
| Cube | 539611597711997 |
| Square root | 285.329634 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.1413 × |
81413 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and thirteen |
| Binary (base 2) | 10011111000000101 |
| Octal (base 8) | 237005 |
| Hexadecimal (base 16) | 13E05 |
| Base 3 | 11010200022 |
| As time | 81413 seconds = 22 h 36 min 53 s |
Is 81413 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 2) | 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 5) | 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 8) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81413 a prime number?
No. 81413 = 17 × 4789, so it is divisible by 17.
What are the factors of 81413?
1, 17, 4789, 81413.
What is 81413 in binary?
10011111000000101 (hexadecimal 13E05, octal 237005).
What is the square root of 81413?
About 285.3296.
Is 81413 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 81413?
81413 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 4789, the product of two primes.