The number 1652
1652 is a composite number with 12 divisors. Its prime factorisation is × 7 × 59. Divisors (12): 1, 2, 4, 7, 14, 28, 59, 118, 236, 413, 826, 1652.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1652: a Harshad number: divisible by its digit sum 14.
- 2
1652 is composite. Its prime factorisation is
- 3
The divisors add up to 3360; without 1652 itself that is 1708, so 1652 is abundant (1708 is more than 1652). Euler's totient φ(1652) = 696 numbers up to 1652 share no factor with it.
- 4
The digits of 1652 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1652 = 2^{2} \times 7 \times 59 \]1652 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 3360 |
| Euler totient φ(n) | 696 |
| Square | 2729104 |
| Cube | 4508479808 |
| Square root | 40.644803 (= 2√413) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 91 |
| Scientific notation | 1.652 × |
1652 in other forms
| Form | Value |
|---|---|
| In words | one thousand six hundred and fifty-two |
| Roman numerals | MDCLII |
| Binary (base 2) | 11001110100 |
| Octal (base 8) | 3164 |
| Hexadecimal (base 16) | 674 |
| Base 3 | 2021012 |
| As time | 1652 seconds = 27 min 32 s |
Is 1652 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1652 ÷ 2 = 826) | 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 | Yes (1652 ÷ 4 = 413) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (1652 ÷ 7 = 236) | 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 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1652 a prime number?
No. 1652 = × 7 × 59, so it is divisible by 2.
What are the factors of 1652?
1, 2, 4, 7, 14, 28, 59, 118, 236, 413, 826, 1652.
What is 1652 in binary?
11001110100 (hexadecimal 674, octal 3164).
What is the square root of 1652?
About 40.6448, exactly 2√413.
What is 1652 in Roman numerals?
MDCLII.
Is 1652 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 1652?
1652 is a Harshad number: divisible by its digit sum 14.