The number 15151
15151 is a palindrome: it reads 15151 backwards too. Its prime factorisation is 109 × 139. Divisors (4): 1, 109, 139, 15151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15151: a palindrome: it reads 15151 backwards too; a semiprime: 109 × 139, the product of two primes.
- 2
15151 is composite. Its prime factorisation is
- 3
The divisors add up to 15400; without 15151 itself that is 249, so 15151 is deficient (249 is less than 15151). Euler's totient φ(15151) = 14904 numbers up to 15151 share no factor with it.
- 4
The digits of 15151 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15151 = 109 \times 139 \]
15151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15400 |
| Euler totient φ(n) | 14904 |
| Square | 229552801 |
| Cube | 3477954487951 |
| Square root | 123.089398 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5151 × |
15151 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and fifty-one |
| Binary (base 2) | 11101100101111 |
| Octal (base 8) | 35457 |
| Hexadecimal (base 16) | 3B2F |
| Base 3 | 202210011 |
| As time | 15151 seconds = 4 h 12 min 31 s |
Is 15151 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 | No (remainder 1) | 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 1) | 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 7) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15151 a prime number?
No. 15151 = 109 × 139, so it is divisible by 109.
What are the factors of 15151?
1, 109, 139, 15151.
What is 15151 in binary?
11101100101111 (hexadecimal 3B2F, octal 35457).
What is the square root of 15151?
About 123.0894.
Is 15151 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15151?
15151 is a palindrome: it reads 15151 backwards too; a semiprime: 109 × 139, the product of two primes.