The number 15235
15235 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 277. Divisors (8): 1, 5, 11, 55, 277, 1385, 3047, 15235.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15235 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15235 is composite. Its prime factorisation is
- 3
The divisors add up to 20016; without 15235 itself that is 4781, so 15235 is deficient (4781 is less than 15235). Euler's totient φ(15235) = 11040 numbers up to 15235 share no factor with it.
- 4
The digits of 15235 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15235 = 5 \times 11 \times 277 \]
15235 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20016 |
| Euler totient φ(n) | 11040 |
| Square | 232105225 |
| Cube | 3536123102875 |
| Square root | 123.430142 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 177 |
| Scientific notation | 1.5235 × |
15235 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and thirty-five |
| Binary (base 2) | 11101110000011 |
| Octal (base 8) | 35603 |
| Hexadecimal (base 16) | 3B83 |
| Base 3 | 202220021 |
| As time | 15235 seconds = 4 h 13 min 55 s |
Is 15235 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 | Yes (15235 ÷ 5 = 3047) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15235 ÷ 11 = 1385) | 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 15235 a prime number?
No. 15235 = 5 × 11 × 277, so it is divisible by 5.
What are the factors of 15235?
1, 5, 11, 55, 277, 1385, 3047, 15235.
What is 15235 in binary?
11101110000011 (hexadecimal 3B83, octal 35603).
What is the square root of 15235?
About 123.4301.
Is 15235 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 15235?
It is a composite number with 8 divisors.