The number 15070
15070 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 137. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 137, 274, 685, 1370, 1507, 3014, 7535, 15070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15070 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15070 is composite. Its prime factorisation is
- 3
The divisors add up to 29808; without 15070 itself that is 14738, so 15070 is deficient (14738 is less than 15070). Euler's totient φ(15070) = 5440 numbers up to 15070 share no factor with it.
- 4
The digits of 15070 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15070 = 2 \times 5 \times 11 \times 137 \]
15070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 29808 |
| Euler totient φ(n) | 5440 |
| Square | 227104900 |
| Cube | 3422470843000 |
| Square root | 122.759928 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.507 × |
15070 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and seventy |
| Binary (base 2) | 11101011011110 |
| Octal (base 8) | 35336 |
| Hexadecimal (base 16) | 3ADE |
| Base 3 | 202200011 |
| As time | 15070 seconds = 4 h 11 min 10 s |
Is 15070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15070 ÷ 2 = 7535) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15070 ÷ 5 = 3014) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15070 ÷ 10 = 1507) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15070 ÷ 11 = 1370) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15070 a prime number?
No. 15070 = 2 × 5 × 11 × 137, so it is divisible by 2.
What are the factors of 15070?
1, 2, 5, 10, 11, 22, 55, 110, 137, 274, 685, 1370, 1507, 3014, 7535, 15070.
What is 15070 in binary?
11101011011110 (hexadecimal 3ADE, octal 35336).
What is the square root of 15070?
About 122.7599.
Is 15070 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15070?
It is a composite number with 16 divisors.