The number 15701
15701 is a composite number with 4 divisors. Its prime factorisation is 7 × 2243. Divisors (4): 1, 7, 2243, 15701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15701: a semiprime: 7 × 2243, the product of two primes.
- 2
15701 is composite. Its prime factorisation is
- 3
The divisors add up to 17952; without 15701 itself that is 2251, so 15701 is deficient (2251 is less than 15701). Euler's totient φ(15701) = 13452 numbers up to 15701 share no factor with it.
- 4
The digits of 15701 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 27 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15701 = 7 \times 2243 \]
15701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17952 |
| Euler totient φ(n) | 13452 |
| Square | 246521401 |
| Cube | 3870632517101 |
| Square root | 125.303631 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 27 |
| Scientific notation | 1.5701 × |
15701 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand seven hundred and one |
| Binary (base 2) | 11110101010101 |
| Octal (base 8) | 36525 |
| Hexadecimal (base 16) | 3D55 |
| Base 3 | 210112112 |
| As time | 15701 seconds = 4 h 21 min 41 s |
Is 15701 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 1) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15701 ÷ 7 = 2243) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15701 a prime number?
No. 15701 = 7 × 2243, so it is divisible by 7.
What are the factors of 15701?
1, 7, 2243, 15701.
What is 15701 in binary?
11110101010101 (hexadecimal 3D55, octal 36525).
What is the square root of 15701?
About 125.3036.
Is 15701 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 15701?
15701 is a semiprime: 7 × 2243, the product of two primes.