The number 1533
1533 is a binary palindrome (10111111101). Its prime factorisation is 3 × 7 × 73. Divisors (8): 1, 3, 7, 21, 73, 219, 511, 1533.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1533: a binary palindrome (10111111101); a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
1533 is composite. Its prime factorisation is
- 3
The divisors add up to 2368; without 1533 itself that is 835, so 1533 is deficient (835 is less than 1533). Euler's totient φ(1533) = 864 numbers up to 1533 share no factor with it.
- 4
The digits of 1533 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1533 = 3 \times 7 \times 73 \]
1533 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2368 |
| Euler totient φ(n) | 864 |
| Square | 2350089 |
| Cube | 3602686437 |
| Square root | 39.153544 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.533 × |
1533 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and thirty-three |
| Roman numerals | MDXXXIII |
| Binary (base 2) | 10111111101 |
| Octal (base 8) | 2775 |
| Hexadecimal (base 16) | 5FD |
| Base 3 | 2002210 |
| As time | 1533 seconds = 25 min 33 s |
Is 1533 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 (1533 ÷ 3 = 511) | 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 | Yes (1533 ÷ 7 = 219) | 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 3) | 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 4) | 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 1533 a prime number?
No. 1533 = 3 × 7 × 73, so it is divisible by 3.
What are the factors of 1533?
1, 3, 7, 21, 73, 219, 511, 1533.
What is 1533 in binary?
10111111101 (hexadecimal 5FD, octal 2775).
What is the square root of 1533?
About 39.1535.
What is 1533 in Roman numerals?
MDXXXIII.
Is 1533 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1533?
1533 is a binary palindrome (10111111101); a happy number: repeatedly adding the squares of its digits reaches 1.