The number 15697
15697 is a composite number with 4 divisors. Its prime factorisation is 11 × 1427. Divisors (4): 1, 11, 1427, 15697.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15697: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 1427, the product of two primes.
- 2
15697 is composite. Its prime factorisation is
- 3
The divisors add up to 17136; without 15697 itself that is 1439, so 15697 is deficient (1439 is less than 15697). Euler's totient φ(15697) = 14260 numbers up to 15697 share no factor with it.
- 4
The digits of 15697 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15697 = 11 \times 1427 \]
15697 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17136 |
| Euler totient φ(n) | 14260 |
| Square | 246395809 |
| Cube | 3867675013873 |
| Square root | 125.287669 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 1.5697 × |
15697 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and ninety-seven |
| Binary (base 2) | 11110101010001 |
| Octal (base 8) | 36521 |
| Hexadecimal (base 16) | 3D51 |
| Base 3 | 210112101 |
| As time | 15697 seconds = 4 h 21 min 37 s |
Is 15697 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | 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 1) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15697 ÷ 11 = 1427) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15697 a prime number?
No. 15697 = 11 × 1427, so it is divisible by 11.
What are the factors of 15697?
1, 11, 1427, 15697.
What is 15697 in binary?
11110101010001 (hexadecimal 3D51, octal 36521).
What is the square root of 15697?
About 125.2877.
Is 15697 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 15697?
15697 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 1427, the product of two primes.