The number 13990
13990 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1399. Divisors (8): 1, 2, 5, 10, 1399, 2798, 6995, 13990.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13990 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13990 is composite. Its prime factorisation is
- 3
The divisors add up to 25200; without 13990 itself that is 11210, so 13990 is deficient (11210 is less than 13990). Euler's totient φ(13990) = 5592 numbers up to 13990 share no factor with it.
- 4
The digits of 13990 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13990 = 2 \times 5 \times 1399 \]
13990 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25200 |
| Euler totient φ(n) | 5592 |
| Square | 195720100 |
| Cube | 2738124199000 |
| Square root | 118.279330 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 107 |
| Scientific notation | 1.399 × |
13990 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand nine hundred and ninety |
| Binary (base 2) | 11011010100110 |
| Octal (base 8) | 33246 |
| Hexadecimal (base 16) | 36A6 |
| Base 3 | 201012011 |
| As time | 13990 seconds = 3 h 53 min 10 s |
Is 13990 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13990 ÷ 2 = 6995) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (13990 ÷ 5 = 2798) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | 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 | Yes (13990 ÷ 10 = 1399) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13990 a prime number?
No. 13990 = 2 × 5 × 1399, so it is divisible by 2.
What are the factors of 13990?
1, 2, 5, 10, 1399, 2798, 6995, 13990.
What is 13990 in binary?
11011010100110 (hexadecimal 36A6, octal 33246).
What is the square root of 13990?
About 118.2793.
Is 13990 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 13990?
It is a composite number with 8 divisors.