The number 81507
81507 is a composite number with 8 divisors. Its prime factorisation is 3 × 101 × 269. Divisors (8): 1, 3, 101, 269, 303, 807, 27169, 81507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81507: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
81507 is composite. Its prime factorisation is
- 3
The divisors add up to 110160; without 81507 itself that is 28653, so 81507 is deficient (28653 is less than 81507). Euler's totient φ(81507) = 53600 numbers up to 81507 share no factor with it.
- 4
The digits of 81507 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 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81507 = 3 \times 101 \times 269 \]
81507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 110160 |
| Euler totient φ(n) | 53600 |
| Square | 6643391049 |
| Cube | 541482874230843 |
| Square root | 285.494308 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 37 |
| Scientific notation | 8.1507 × |
81507 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and seven |
| Binary (base 2) | 10011111001100011 |
| Octal (base 8) | 237143 |
| Hexadecimal (base 16) | 13E63 |
| Base 3 | 11010210210 |
| As time | 81507 seconds = 22 h 38 min 27 s |
Is 81507 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 (81507 ÷ 3 = 27169) | 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 | No (remainder 2) | 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 6) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 81507 a prime number?
No. 81507 = 3 × 101 × 269, so it is divisible by 3.
What are the factors of 81507?
1, 3, 101, 269, 303, 807, 27169, 81507.
What is 81507 in binary?
10011111001100011 (hexadecimal 13E63, octal 237143).
What is the square root of 81507?
About 285.4943.
Is 81507 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 81507?
81507 is a happy number: repeatedly adding the squares of its digits reaches 1.