The number 1527
1527 is a composite number with 4 divisors. Its prime factorisation is 3 × 509. Divisors (4): 1, 3, 509, 1527.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1527: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 509, the product of two primes.
- 2
1527 is composite. Its prime factorisation is
- 3
The divisors add up to 2040; without 1527 itself that is 513, so 1527 is deficient (513 is less than 1527). Euler's totient φ(1527) = 1016 numbers up to 1527 share no factor with it.
- 4
The digits of 1527 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 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1527 = 3 \times 509 \]
1527 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2040 |
| Euler totient φ(n) | 1016 |
| Square | 2331729 |
| Cube | 3560550183 |
| Square root | 39.076847 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 153 |
| Scientific notation | 1.527 × |
1527 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and twenty-seven |
| Roman numerals | MDXXVII |
| Binary (base 2) | 10111110111 |
| Octal (base 8) | 2767 |
| Hexadecimal (base 16) | 5F7 |
| Base 3 | 2002120 |
| As time | 1527 seconds = 25 min 27 s |
Is 1527 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 (1527 ÷ 3 = 509) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 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 7) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1527 a prime number?
No. 1527 = 3 × 509, so it is divisible by 3.
What are the factors of 1527?
1, 3, 509, 1527.
What is 1527 in binary?
10111110111 (hexadecimal 5F7, octal 2767).
What is the square root of 1527?
About 39.0768.
What is 1527 in Roman numerals?
MDXXVII.
Is 1527 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1527?
1527 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 509, the product of two primes.