The number 15063
15063 is a binary palindrome (11101011010111). Its prime factorisation is 3 × 5021. Divisors (4): 1, 3, 5021, 15063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15063: a binary palindrome (11101011010111); a semiprime: 3 × 5021, the product of two primes.
- 2
15063 is composite. Its prime factorisation is
- 3
The divisors add up to 20088; without 15063 itself that is 5025, so 15063 is deficient (5025 is less than 15063). Euler's totient φ(15063) = 10040 numbers up to 15063 share no factor with it.
- 4
The digits of 15063 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 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15063 = 3 \times 5021 \]
15063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20088 |
| Euler totient φ(n) | 10040 |
| Square | 226893969 |
| Cube | 3417703855047 |
| Square root | 122.731414 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.5063 × |
15063 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and sixty-three |
| Binary (base 2) | 11101011010111 |
| Octal (base 8) | 35327 |
| Hexadecimal (base 16) | 3AD7 |
| Base 3 | 202122220 |
| As time | 15063 seconds = 4 h 11 min 3 s |
Is 15063 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 (15063 ÷ 3 = 5021) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 15063 a prime number?
No. 15063 = 3 × 5021, so it is divisible by 3.
What are the factors of 15063?
1, 3, 5021, 15063.
What is 15063 in binary?
11101011010111 (hexadecimal 3AD7, octal 35327).
What is the square root of 15063?
About 122.7314.
Is 15063 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15063?
15063 is a binary palindrome (11101011010111); a semiprime: 3 × 5021, the product of two primes.