The number 15202
15202 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 691. Divisors (8): 1, 2, 11, 22, 691, 1382, 7601, 15202.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15202 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15202 is composite. Its prime factorisation is
- 3
The divisors add up to 24912; without 15202 itself that is 9710, so 15202 is deficient (9710 is less than 15202). Euler's totient φ(15202) = 6900 numbers up to 15202 share no factor with it.
- 4
The digits of 15202 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15202 = 2 \times 11 \times 691 \]
15202 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24912 |
| Euler totient φ(n) | 6900 |
| Square | 231100804 |
| Cube | 3513194422408 |
| Square root | 123.296391 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 32 |
| Scientific notation | 1.5202 × |
15202 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and two |
| Binary (base 2) | 11101101100010 |
| Octal (base 8) | 35542 |
| Hexadecimal (base 16) | 3B62 |
| Base 3 | 202212001 |
| As time | 15202 seconds = 4 h 13 min 22 s |
Is 15202 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15202 ÷ 2 = 7601) | 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 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 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 | Yes (15202 ÷ 11 = 1382) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15202 a prime number?
No. 15202 = 2 × 11 × 691, so it is divisible by 2.
What are the factors of 15202?
1, 2, 11, 22, 691, 1382, 7601, 15202.
What is 15202 in binary?
11101101100010 (hexadecimal 3B62, octal 35542).
What is the square root of 15202?
About 123.2964.
Is 15202 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 15202?
It is a composite number with 8 divisors.