The number 81435
81435 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 61 × 89. Divisors (16): 1, 3, 5, 15, 61, 89, 183, 267, 305, 445, 915, 1335, 5429, 16287, 27145, 81435.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81435 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81435 is composite. Its prime factorisation is
- 3
The divisors add up to 133920; without 81435 itself that is 52485, so 81435 is deficient (52485 is less than 81435). Euler's totient φ(81435) = 42240 numbers up to 81435 share no factor with it.
- 4
The digits of 81435 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 244 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81435 = 3 \times 5 \times 61 \times 89 \]
81435 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 133920 |
| Euler totient φ(n) | 42240 |
| Square | 6631659225 |
| Cube | 540049168987875 |
| Square root | 285.368183 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 244 |
| Scientific notation | 8.1435 × |
81435 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand four hundred and thirty-five |
| Binary (base 2) | 10011111000011011 |
| Octal (base 8) | 237033 |
| Hexadecimal (base 16) | 13E1B |
| Base 3 | 11010201010 |
| As time | 81435 seconds = 22 h 37 min 15 s |
Is 81435 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 (81435 ÷ 3 = 27145) | 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 | Yes (81435 ÷ 5 = 16287) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81435 a prime number?
No. 81435 = 3 × 5 × 61 × 89, so it is divisible by 3.
What are the factors of 81435?
1, 3, 5, 15, 61, 89, 183, 267, 305, 445, 915, 1335, 5429, 16287, 27145, 81435.
What is 81435 in binary?
10011111000011011 (hexadecimal 13E1B, octal 237033).
What is the square root of 81435?
About 285.3682.
Is 81435 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 81435?
It is a composite number with 16 divisors.