The number 81150
81150 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 541. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 541, 1082, 1623, 2705 … 81150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81150: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.
- 2
81150 is composite. Its prime factorisation is
- 3
The divisors add up to 201624; without 81150 itself that is 120474, so 81150 is abundant (120474 is more than 81150). Euler's totient φ(81150) = 21600 numbers up to 81150 share no factor with it.
- 4
The digits of 81150 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 169 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81150 = 2 \times 3 \times 5^{2} \times 541 \]81150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 201624 |
| Euler totient φ(n) | 21600 |
| Square | 6585322500 |
| Cube | 534398920875000 |
| Square root | 284.868391 (= 5√3246) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 169 |
| Scientific notation | 8.115 × |
81150 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand one hundred and fifty |
| Binary (base 2) | 10011110011111110 |
| Octal (base 8) | 236376 |
| Hexadecimal (base 16) | 13CFE |
| Base 3 | 11010022120 |
| As time | 81150 seconds = 22 h 32 min 30 s |
Is 81150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (81150 ÷ 2 = 40575) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (81150 ÷ 3 = 27050) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (81150 ÷ 5 = 16230) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (81150 ÷ 6 = 13525) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (81150 ÷ 10 = 8115) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 81150 a prime number?
No. 81150 = 2 × 3 × × 541, so it is divisible by 2.
What are the factors of 81150?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 541, 1082, 1623, 2705, 3246, 5410, 8115, 13525, 16230, 27050, 40575, 81150.
What is 81150 in binary?
10011110011111110 (hexadecimal 13CFE, octal 236376).
What is the square root of 81150?
About 284.8684, exactly 5√3246.
Is 81150 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 81150?
81150 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.