The number 1529
1529 is a composite number with 4 divisors. Its prime factorisation is 11 × 139. Divisors (4): 1, 11, 139, 1529.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1529: a semiprime: 11 × 139, the product of two primes.
- 2
1529 is composite. Its prime factorisation is
- 3
The divisors add up to 1680; without 1529 itself that is 151, so 1529 is deficient (151 is less than 1529). Euler's totient φ(1529) = 1380 numbers up to 1529 share no factor with it.
- 4
The digits of 1529 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1529 = 11 \times 139 \]
1529 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1680 |
| Euler totient φ(n) | 1380 |
| Square | 2337841 |
| Cube | 3574558889 |
| Square root | 39.102430 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.529 × |
1529 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and twenty-nine |
| Roman numerals | MDXXIX |
| Binary (base 2) | 10111111001 |
| Octal (base 8) | 2771 |
| Hexadecimal (base 16) | 5F9 |
| Base 3 | 2002122 |
| As time | 1529 seconds = 25 min 29 s |
Is 1529 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 4) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (1529 ÷ 11 = 139) | 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 1529 a prime number?
No. 1529 = 11 × 139, so it is divisible by 11.
What are the factors of 1529?
1, 11, 139, 1529.
What is 1529 in binary?
10111111001 (hexadecimal 5F9, octal 2771).
What is the square root of 1529?
About 39.1024.
What is 1529 in Roman numerals?
MDXXIX.
Is 1529 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 1529?
1529 is a semiprime: 11 × 139, the product of two primes.