The number 15152
15152 is a composite number with 10 divisors. Its prime factorisation is × 947. Divisors (10): 1, 2, 4, 8, 16, 947, 1894, 3788, 7576, 15152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15152 is composite. Its prime factorisation is
- 3
The divisors add up to 29388; without 15152 itself that is 14236, so 15152 is deficient (14236 is less than 15152). Euler's totient φ(15152) = 7568 numbers up to 15152 share no factor with it.
- 4
The digits of 15152 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15152 = 2^{4} \times 947 \]15152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 29388 |
| Euler totient φ(n) | 7568 |
| Square | 229583104 |
| Cube | 3478643191808 |
| Square root | 123.093460 (= 4√947) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5152 × |
15152 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and fifty-two |
| Binary (base 2) | 11101100110000 |
| Octal (base 8) | 35460 |
| Hexadecimal (base 16) | 3B30 |
| Base 3 | 202210012 |
| As time | 15152 seconds = 4 h 12 min 32 s |
Is 15152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15152 ÷ 2 = 7576) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15152 ÷ 4 = 3788) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (15152 ÷ 8 = 1894) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15152 a prime number?
No. 15152 = × 947, so it is divisible by 2.
What are the factors of 15152?
1, 2, 4, 8, 16, 947, 1894, 3788, 7576, 15152.
What is 15152 in binary?
11101100110000 (hexadecimal 3B30, octal 35460).
What is the square root of 15152?
About 123.0935, exactly 4√947.
Is 15152 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 15152?
It is a composite number with 10 divisors.