The number 15081
15081 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 457. Divisors (8): 1, 3, 11, 33, 457, 1371, 5027, 15081.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15081: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15081 is composite. Its prime factorisation is
- 3
The divisors add up to 21984; without 15081 itself that is 6903, so 15081 is deficient (6903 is less than 15081). Euler's totient φ(15081) = 9120 numbers up to 15081 share no factor with it.
- 4
The digits of 15081 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15081 = 3 \times 11 \times 457 \]
15081 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21984 |
| Euler totient φ(n) | 9120 |
| Square | 227436561 |
| Cube | 3429970776441 |
| Square root | 122.804723 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5081 × |
15081 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and eighty-one |
| Binary (base 2) | 11101011101001 |
| Octal (base 8) | 35351 |
| Hexadecimal (base 16) | 3AE9 |
| Base 3 | 202200120 |
| As time | 15081 seconds = 4 h 11 min 21 s |
Is 15081 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 (15081 ÷ 3 = 5027) | 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 1) | 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 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 1) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15081 ÷ 11 = 1371) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15081 a prime number?
No. 15081 = 3 × 11 × 457, so it is divisible by 3.
What are the factors of 15081?
1, 3, 11, 33, 457, 1371, 5027, 15081.
What is 15081 in binary?
11101011101001 (hexadecimal 3AE9, octal 35351).
What is the square root of 15081?
About 122.8047.
Is 15081 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15081?
15081 is a happy number: repeatedly adding the squares of its digits reaches 1.