The number 15270
15270 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 509. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 509, 1018, 1527, 2545, 3054, 5090, 7635, 15270.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15270: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.
- 2
15270 is composite. Its prime factorisation is
- 3
The divisors add up to 36720; without 15270 itself that is 21450, so 15270 is abundant (21450 is more than 15270). Euler's totient φ(15270) = 4064 numbers up to 15270 share no factor with it.
- 4
The digits of 15270 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15270 = 2 \times 3 \times 5 \times 509 \]
15270 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 36720 |
| Euler totient φ(n) | 4064 |
| Square | 233172900 |
| Cube | 3560550183000 |
| Square root | 123.571841 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.527 × |
15270 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and seventy |
| Binary (base 2) | 11101110100110 |
| Octal (base 8) | 35646 |
| Hexadecimal (base 16) | 3BA6 |
| Base 3 | 202221120 |
| As time | 15270 seconds = 4 h 14 min 30 s |
Is 15270 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15270 ÷ 2 = 7635) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15270 ÷ 3 = 5090) | 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 (15270 ÷ 5 = 3054) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15270 ÷ 6 = 2545) | 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 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 (15270 ÷ 10 = 1527) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15270 a prime number?
No. 15270 = 2 × 3 × 5 × 509, so it is divisible by 2.
What are the factors of 15270?
1, 2, 3, 5, 6, 10, 15, 30, 509, 1018, 1527, 2545, 3054, 5090, 7635, 15270.
What is 15270 in binary?
11101110100110 (hexadecimal 3BA6, octal 35646).
What is the square root of 15270?
About 123.5718.
Is 15270 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15270?
15270 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.