The number 81523
81523 is a composite number with 4 divisors. Its prime factorisation is 13 × 6271. Divisors (4): 1, 13, 6271, 81523.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81523: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 6271, the product of two primes.
- 2
81523 is composite. Its prime factorisation is
- 3
The divisors add up to 87808; without 81523 itself that is 6285, so 81523 is deficient (6285 is less than 81523). Euler's totient φ(81523) = 75240 numbers up to 81523 share no factor with it.
- 4
The digits of 81523 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81523 = 13 \times 6271 \]
81523 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 87808 |
| Euler totient φ(n) | 75240 |
| Square | 6645999529 |
| Cube | 541801819602667 |
| Square root | 285.522328 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.1523 × |
81523 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand five hundred and twenty-three |
| Binary (base 2) | 10011111001110011 |
| Octal (base 8) | 237163 |
| Hexadecimal (base 16) | 13E73 |
| Base 3 | 11010211101 |
| As time | 81523 seconds = 22 h 38 min 43 s |
Is 81523 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 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81523 a prime number?
No. 81523 = 13 × 6271, so it is divisible by 13.
What are the factors of 81523?
1, 13, 6271, 81523.
What is 81523 in binary?
10011111001110011 (hexadecimal 13E73, octal 237163).
What is the square root of 81523?
About 285.5223.
Is 81523 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 81523?
81523 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 6271, the product of two primes.