The number 1653
1653 is a triangular number: 1 + 2 + … + 57 = 1653. Its prime factorisation is 3 × 19 × 29. Divisors (8): 1, 3, 19, 29, 57, 87, 551, 1653.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1653: a triangular number: 1 + 2 + … + 57 = 1653.
- 2
1653 is composite. Its prime factorisation is
- 3
The divisors add up to 2400; without 1653 itself that is 747, so 1653 is deficient (747 is less than 1653). Euler's totient φ(1653) = 1008 numbers up to 1653 share no factor with it.
- 4
The digits of 1653 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1653 = 3 \times 19 \times 29 \]
1653 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2400 |
| Euler totient φ(n) | 1008 |
| Square | 2732409 |
| Cube | 4516672077 |
| Square root | 40.657103 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 1.653 × |
1653 in other forms
| Form | Value |
|---|---|
| In words | one thousand six hundred and fifty-three |
| Roman numerals | MDCLIII |
| Binary (base 2) | 11001110101 |
| Octal (base 8) | 3165 |
| Hexadecimal (base 16) | 675 |
| Base 3 | 2021020 |
| As time | 1653 seconds = 27 min 33 s |
Is 1653 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 | Yes (1653 ÷ 3 = 551) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1653 a prime number?
No. 1653 = 3 × 19 × 29, so it is divisible by 3.
What are the factors of 1653?
1, 3, 19, 29, 57, 87, 551, 1653.
What is 1653 in binary?
11001110101 (hexadecimal 675, octal 3165).
What is the square root of 1653?
About 40.6571.
What is 1653 in Roman numerals?
MDCLIII.
Is 1653 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1653?
1653 is a triangular number: 1 + 2 + … + 57 = 1653.