The number 15641
15641 is a twin prime (15641 and 15643 are both prime) and the 1823rd prime number. Its only divisors are 1 and 15641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15641: a twin prime (15641 and 15643 are both prime); the 1823rd prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15641 is prime, so its only factors are 1 and 15641. It is the 1823rd prime; the next prime is 15643 and the one before is 15629.
- 3
The divisors add up to 15642; without 15641 itself that is 1, so 15641 is deficient (1 is less than 15641). Euler's totient φ(15641) = 15640 numbers up to 15641 share no factor with it.
- 4
The digits of 15641 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
15641 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 15642 |
| Euler totient φ(n) | 15640 |
| Square | 244640881 |
| Cube | 3826428019721 |
| Square root | 125.063984 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 107 |
| Scientific notation | 1.5641 × |
15641 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and forty-one |
| Binary (base 2) | 11110100011001 |
| Octal (base 8) | 36431 |
| Hexadecimal (base 16) | 3D19 |
| Base 3 | 210110022 |
| As time | 15641 seconds = 4 h 20 min 41 s |
Is 15641 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 | 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 8) | 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 10) | 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 15641 a prime number?
Yes. 15641 is divisible only by 1 and itself.
What are the factors of 15641?
1, 15641.
What is 15641 in binary?
11110100011001 (hexadecimal 3D19, octal 36431).
What is the square root of 15641?
About 125.0640.
Is 15641 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15641?
15641 is a twin prime (15641 and 15643 are both prime); the 1823rd prime number; a happy number: repeatedly adding the squares of its digits reaches 1.