The number 15642
15642 is a composite number with 24 divisors. Its prime factorisation is 2 × × 11 × 79. Divisors (24): 1, 2, 3, 6, 9, 11, 18, 22, 33, 66, 79, 99, 158, 198, 237, 474 … 15642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15642: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
15642 is composite. Its prime factorisation is
- 3
The divisors add up to 37440; without 15642 itself that is 21798, so 15642 is abundant (21798 is more than 15642). Euler's totient φ(15642) = 4680 numbers up to 15642 share no factor with it.
- 4
The digits of 15642 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15642 = 2 \times 3^{2} \times 11 \times 79 \]15642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 37440 |
| Euler totient φ(n) | 4680 |
| Square | 244672164 |
| Cube | 3827161989288 |
| Square root | 125.067982 (= 3√1738) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.5642 × |
15642 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and forty-two |
| Binary (base 2) | 11110100011010 |
| Octal (base 8) | 36432 |
| Hexadecimal (base 16) | 3D1A |
| Base 3 | 210110100 |
| As time | 15642 seconds = 4 h 20 min 42 s |
Is 15642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15642 ÷ 2 = 7821) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15642 ÷ 3 = 5214) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (15642 ÷ 6 = 2607) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15642 ÷ 9 = 1738) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15642 ÷ 11 = 1422) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15642 a prime number?
No. 15642 = 2 × × 11 × 79, so it is divisible by 2.
What are the factors of 15642?
1, 2, 3, 6, 9, 11, 18, 22, 33, 66, 79, 99, 158, 198, 237, 474, 711, 869, 1422, 1738, 2607, 5214, 7821, 15642.
What is 15642 in binary?
11110100011010 (hexadecimal 3D1A, octal 36432).
What is the square root of 15642?
About 125.0680, exactly 3√1738.
Is 15642 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15642?
15642 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.