The number 15153
15153 is a composite number with 4 divisors. Its prime factorisation is 3 × 5051. Divisors (4): 1, 3, 5051, 15153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15153: a semiprime: 3 × 5051, the product of two primes.
- 2
15153 is composite. Its prime factorisation is
- 3
The divisors add up to 20208; without 15153 itself that is 5055, so 15153 is deficient (5055 is less than 15153). Euler's totient φ(15153) = 10100 numbers up to 15153 share no factor with it.
- 4
The digits of 15153 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
\[ 15153 = 3 \times 5051 \]
15153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20208 |
| Euler totient φ(n) | 10100 |
| Square | 229613409 |
| Cube | 3479331986577 |
| Square root | 123.097522 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5153 × |
15153 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and fifty-three |
| Binary (base 2) | 11101100110001 |
| Octal (base 8) | 35461 |
| Hexadecimal (base 16) | 3B31 |
| Base 3 | 202210020 |
| As time | 15153 seconds = 4 h 12 min 33 s |
Is 15153 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 (15153 ÷ 3 = 5051) | 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 3) | 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 15153 a prime number?
No. 15153 = 3 × 5051, so it is divisible by 3.
What are the factors of 15153?
1, 3, 5051, 15153.
What is 15153 in binary?
11101100110001 (hexadecimal 3B31, octal 35461).
What is the square root of 15153?
About 123.0975.
Is 15153 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15153?
15153 is a semiprime: 3 × 5051, the product of two primes.