The number 15223
15223 is a composite number with 4 divisors. Its prime factorisation is 13 × 1171. Divisors (4): 1, 13, 1171, 15223.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15223: a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 1171, the product of two primes.
- 2
15223 is composite. Its prime factorisation is
- 3
The divisors add up to 16408; without 15223 itself that is 1185, so 15223 is deficient (1185 is less than 15223). Euler's totient φ(15223) = 14040 numbers up to 15223 share no factor with it.
- 4
The digits of 15223 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15223 = 13 \times 1171 \]
15223 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16408 |
| Euler totient φ(n) | 14040 |
| Square | 231739729 |
| Cube | 3527773894567 |
| Square root | 123.381522 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5223 × |
15223 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and twenty-three |
| Binary (base 2) | 11101101110111 |
| Octal (base 8) | 35567 |
| Hexadecimal (base 16) | 3B77 |
| Base 3 | 202212211 |
| As time | 15223 seconds = 4 h 13 min 43 s |
Is 15223 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 | No (remainder 3) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 10) | 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 15223 a prime number?
No. 15223 = 13 × 1171, so it is divisible by 13.
What are the factors of 15223?
1, 13, 1171, 15223.
What is 15223 in binary?
11101101110111 (hexadecimal 3B77, octal 35567).
What is the square root of 15223?
About 123.3815.
Is 15223 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 15223?
15223 is a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 1171, the product of two primes.