The number 13663
13663 is a composite number with 4 divisors. Its prime factorisation is 13 × 1051. Divisors (4): 1, 13, 1051, 13663.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13663: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 1051, the product of two primes.
- 2
13663 is composite. Its prime factorisation is
- 3
The divisors add up to 14728; without 13663 itself that is 1065, so 13663 is deficient (1065 is less than 13663). Euler's totient φ(13663) = 12600 numbers up to 13663 share no factor with it.
- 4
The digits of 13663 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13663 = 13 \times 1051 \]
13663 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14728 |
| Euler totient φ(n) | 12600 |
| Square | 186677569 |
| Cube | 2550575625247 |
| Square root | 116.888836 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.3663 × |
13663 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand six hundred and sixty-three |
| Binary (base 2) | 11010101011111 |
| Octal (base 8) | 32537 |
| Hexadecimal (base 16) | 355F |
| Base 3 | 200202001 |
| As time | 13663 seconds = 3 h 47 min 43 s |
Is 13663 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 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 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 1) | 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 13663 a prime number?
No. 13663 = 13 × 1051, so it is divisible by 13.
What are the factors of 13663?
1, 13, 1051, 13663.
What is 13663 in binary?
11010101011111 (hexadecimal 355F, octal 32537).
What is the square root of 13663?
About 116.8888.
Is 13663 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 13663?
13663 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 1051, the product of two primes.