The number 13951
13951 is a composite number with 4 divisors. Its prime factorisation is 7 × 1993. Divisors (4): 1, 7, 1993, 13951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13951: a semiprime: 7 × 1993, the product of two primes.
- 2
13951 is composite. Its prime factorisation is
- 3
The divisors add up to 15952; without 13951 itself that is 2001, so 13951 is deficient (2001 is less than 13951). Euler's totient φ(13951) = 11952 numbers up to 13951 share no factor with it.
- 4
The digits of 13951 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13951 = 7 \times 1993 \]
13951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15952 |
| Euler totient φ(n) | 11952 |
| Square | 194630401 |
| Cube | 2715288724351 |
| Square root | 118.114351 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.3951 × |
13951 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand nine hundred and fifty-one |
| Binary (base 2) | 11011001111111 |
| Octal (base 8) | 33177 |
| Hexadecimal (base 16) | 367F |
| Base 3 | 201010201 |
| As time | 13951 seconds = 3 h 52 min 31 s |
Is 13951 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 1) | 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 | Yes (13951 ÷ 7 = 1993) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 13951 a prime number?
No. 13951 = 7 × 1993, so it is divisible by 7.
What are the factors of 13951?
1, 7, 1993, 13951.
What is 13951 in binary?
11011001111111 (hexadecimal 367F, octal 33177).
What is the square root of 13951?
About 118.1144.
Is 13951 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 13951?
13951 is a semiprime: 7 × 1993, the product of two primes.