The number 15213
15213 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 461. Divisors (8): 1, 3, 11, 33, 461, 1383, 5071, 15213.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15213 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15213 is composite. Its prime factorisation is
- 3
The divisors add up to 22176; without 15213 itself that is 6963, so 15213 is deficient (6963 is less than 15213). Euler's totient φ(15213) = 9200 numbers up to 15213 share no factor with it.
- 4
The digits of 15213 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15213 = 3 \times 11 \times 461 \]
15213 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22176 |
| Euler totient φ(n) | 9200 |
| Square | 231435369 |
| Cube | 3520826268597 |
| Square root | 123.340991 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5213 × |
15213 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and thirteen |
| Binary (base 2) | 11101101101101 |
| Octal (base 8) | 35555 |
| Hexadecimal (base 16) | 3B6D |
| Base 3 | 202212110 |
| As time | 15213 seconds = 4 h 13 min 33 s |
Is 15213 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 (15213 ÷ 3 = 5071) | 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 3) | 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 2) | 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 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15213 ÷ 11 = 1383) | 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 15213 a prime number?
No. 15213 = 3 × 11 × 461, so it is divisible by 3.
What are the factors of 15213?
1, 3, 11, 33, 461, 1383, 5071, 15213.
What is 15213 in binary?
11101101101101 (hexadecimal 3B6D, octal 35555).
What is the square root of 15213?
About 123.3410.
Is 15213 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15213?
It is a composite number with 8 divisors.