The number 14563
14563 is a twin prime (14561 and 14563 are both prime) and the 1708th prime number. Its only divisors are 1 and 14563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14563: a twin prime (14561 and 14563 are both prime); the 1708th prime number.
- 2
14563 is prime, so its only factors are 1 and 14563. It is the 1708th prime; the next prime is 14591 and the one before is 14561.
- 3
The divisors add up to 14564; without 14563 itself that is 1, so 14563 is deficient (1 is less than 14563). Euler's totient φ(14563) = 14562 numbers up to 14563 share no factor with it.
- 4
The digits of 14563 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 19 steps to reach 1.
14563 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 14564 |
| Euler totient φ(n) | 14562 |
| Square | 212080969 |
| Cube | 3088535151547 |
| Square root | 120.677256 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 19 |
| Scientific notation | 1.4563 × |
14563 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and sixty-three |
| Binary (base 2) | 11100011100011 |
| Octal (base 8) | 34343 |
| Hexadecimal (base 16) | 38E3 |
| Base 3 | 201222101 |
| As time | 14563 seconds = 4 h 2 min 43 s |
Is 14563 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 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 3) | 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 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 14563 a prime number?
Yes. 14563 is divisible only by 1 and itself.
What are the factors of 14563?
1, 14563.
What is 14563 in binary?
11100011100011 (hexadecimal 38E3, octal 34343).
What is the square root of 14563?
About 120.6773.
Is 14563 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14563?
14563 is a twin prime (14561 and 14563 are both prime); the 1708th prime number.