The number 15102
15102 is a composite number with 12 divisors. Its prime factorisation is 2 × × 839. Divisors (12): 1, 2, 3, 6, 9, 18, 839, 1678, 2517, 5034, 7551, 15102.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15102: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
15102 is composite. Its prime factorisation is
- 3
The divisors add up to 32760; without 15102 itself that is 17658, so 15102 is abundant (17658 is more than 15102). Euler's totient φ(15102) = 5028 numbers up to 15102 share no factor with it.
- 4
The digits of 15102 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15102 = 2 \times 3^{2} \times 839 \]15102 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 32760 |
| Euler totient φ(n) | 5028 |
| Square | 228070404 |
| Cube | 3444319241208 |
| Square root | 122.890195 (= 3√1678) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5102 × |
15102 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and two |
| Binary (base 2) | 11101011111110 |
| Octal (base 8) | 35376 |
| Hexadecimal (base 16) | 3AFE |
| Base 3 | 202201100 |
| As time | 15102 seconds = 4 h 11 min 42 s |
Is 15102 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15102 ÷ 2 = 7551) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15102 ÷ 3 = 5034) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (15102 ÷ 6 = 2517) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15102 ÷ 9 = 1678) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15102 a prime number?
No. 15102 = 2 × × 839, so it is divisible by 2.
What are the factors of 15102?
1, 2, 3, 6, 9, 18, 839, 1678, 2517, 5034, 7551, 15102.
What is 15102 in binary?
11101011111110 (hexadecimal 3AFE, octal 35376).
What is the square root of 15102?
About 122.8902, exactly 3√1678.
Is 15102 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 15102?
15102 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.