The number 15135
15135 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 1009. Divisors (8): 1, 3, 5, 15, 1009, 3027, 5045, 15135.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15135: a Harshad number: divisible by its digit sum 15.
- 2
15135 is composite. Its prime factorisation is
- 3
The divisors add up to 24240; without 15135 itself that is 9105, so 15135 is deficient (9105 is less than 15135). Euler's totient φ(15135) = 8064 numbers up to 15135 share no factor with it.
- 4
The digits of 15135 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 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15135 = 3 \times 5 \times 1009 \]
15135 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24240 |
| Euler totient φ(n) | 8064 |
| Square | 229068225 |
| Cube | 3466947585375 |
| Square root | 123.024388 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.5135 × |
15135 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and thirty-five |
| Binary (base 2) | 11101100011111 |
| Octal (base 8) | 35437 |
| Hexadecimal (base 16) | 3B1F |
| Base 3 | 202202120 |
| As time | 15135 seconds = 4 h 12 min 15 s |
Is 15135 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 (15135 ÷ 3 = 5045) | 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 (15135 ÷ 5 = 3027) | 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 1) | 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 6) | 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 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15135 a prime number?
No. 15135 = 3 × 5 × 1009, so it is divisible by 3.
What are the factors of 15135?
1, 3, 5, 15, 1009, 3027, 5045, 15135.
What is 15135 in binary?
11101100011111 (hexadecimal 3B1F, octal 35437).
What is the square root of 15135?
About 123.0244.
Is 15135 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15135?
15135 is a Harshad number: divisible by its digit sum 15.