The number 13955
13955 is a composite number with 4 divisors. Its prime factorisation is 5 × 2791. Divisors (4): 1, 5, 2791, 13955.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13955: a semiprime: 5 × 2791, the product of two primes.
- 2
13955 is composite. Its prime factorisation is
- 3
The divisors add up to 16752; without 13955 itself that is 2797, so 13955 is deficient (2797 is less than 13955). Euler's totient φ(13955) = 11160 numbers up to 13955 share no factor with it.
- 4
The digits of 13955 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13955 = 5 \times 2791 \]
13955 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16752 |
| Euler totient φ(n) | 11160 |
| Square | 194742025 |
| Cube | 2717624958875 |
| Square root | 118.131283 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 32 |
| Scientific notation | 1.3955 × |
13955 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand nine hundred and fifty-five |
| Binary (base 2) | 11011010000011 |
| Octal (base 8) | 33203 |
| Hexadecimal (base 16) | 3683 |
| Base 3 | 201010212 |
| As time | 13955 seconds = 3 h 52 min 35 s |
Is 13955 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 2) | 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 | Yes (13955 ÷ 5 = 2791) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13955 a prime number?
No. 13955 = 5 × 2791, so it is divisible by 5.
What are the factors of 13955?
1, 5, 2791, 13955.
What is 13955 in binary?
11011010000011 (hexadecimal 3683, octal 33203).
What is the square root of 13955?
About 118.1313.
Is 13955 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 13955?
13955 is a semiprime: 5 × 2791, the product of two primes.