The number 15237
15237 is a composite number with 6 divisors. Its prime factorisation is × 1693. Divisors (6): 1, 3, 9, 1693, 5079, 15237.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15237 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15237 is composite. Its prime factorisation is
- 3
The divisors add up to 22022; without 15237 itself that is 6785, so 15237 is deficient (6785 is less than 15237). Euler's totient φ(15237) = 10152 numbers up to 15237 share no factor with it.
- 4
The digits of 15237 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15237 = 3^{2} \times 1693 \]15237 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 22022 |
| Euler totient φ(n) | 10152 |
| Square | 232166169 |
| Cube | 3537515917053 |
| Square root | 123.438244 (= 3√1693) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 177 |
| Scientific notation | 1.5237 × |
15237 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and thirty-seven |
| Binary (base 2) | 11101110000101 |
| Octal (base 8) | 35605 |
| Hexadecimal (base 16) | 3B85 |
| Base 3 | 202220100 |
| As time | 15237 seconds = 4 h 13 min 57 s |
Is 15237 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 (15237 ÷ 3 = 5079) | 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 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15237 ÷ 9 = 1693) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 15237 a prime number?
No. 15237 = × 1693, so it is divisible by 3.
What are the factors of 15237?
1, 3, 9, 1693, 5079, 15237.
What is 15237 in binary?
11101110000101 (hexadecimal 3B85, octal 35605).
What is the square root of 15237?
About 123.4382, exactly 3√1693.
Is 15237 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15237?
It is a composite number with 6 divisors.