The number 15051
15051 is a triangular number: 1 + 2 + … + 173 = 15051 and a palindrome: it reads 15051 backwards too. Its prime factorisation is 3 × 29 × 173. Divisors (8): 1, 3, 29, 87, 173, 519, 5017, 15051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15051: a triangular number: 1 + 2 + … + 173 = 15051; a palindrome: it reads 15051 backwards too.
- 2
15051 is composite. Its prime factorisation is
- 3
The divisors add up to 20880; without 15051 itself that is 5829, so 15051 is deficient (5829 is less than 15051). Euler's totient φ(15051) = 9632 numbers up to 15051 share no factor with it.
- 4
The digits of 15051 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15051 = 3 \times 29 \times 173 \]
15051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20880 |
| Euler totient φ(n) | 9632 |
| Square | 226532601 |
| Cube | 3409542177651 |
| Square root | 122.682517 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 208 |
| Scientific notation | 1.5051 × |
15051 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and fifty-one |
| Binary (base 2) | 11101011001011 |
| Octal (base 8) | 35313 |
| Hexadecimal (base 16) | 3ACB |
| Base 3 | 202122110 |
| As time | 15051 seconds = 4 h 10 min 51 s |
Is 15051 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 (15051 ÷ 3 = 5017) | 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 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 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 3) | 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 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15051 a prime number?
No. 15051 = 3 × 29 × 173, so it is divisible by 3.
What are the factors of 15051?
1, 3, 29, 87, 173, 519, 5017, 15051.
What is 15051 in binary?
11101011001011 (hexadecimal 3ACB, octal 35313).
What is the square root of 15051?
About 122.6825.
Is 15051 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15051?
15051 is a triangular number: 1 + 2 + … + 173 = 15051; a palindrome: it reads 15051 backwards too.