The number 1522
1522 is a composite number with 4 divisors. Its prime factorisation is 2 × 761. Divisors (4): 1, 2, 761, 1522.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1522: a semiprime: 2 × 761, the product of two primes.
- 2
1522 is composite. Its prime factorisation is
- 3
The divisors add up to 2286; without 1522 itself that is 764, so 1522 is deficient (764 is less than 1522). Euler's totient φ(1522) = 760 numbers up to 1522 share no factor with it.
- 4
The digits of 1522 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1522 = 2 \times 761 \]
1522 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2286 |
| Euler totient φ(n) | 760 |
| Square | 2316484 |
| Cube | 3525688648 |
| Square root | 39.012818 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 34 |
| Scientific notation | 1.522 × |
1522 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and twenty-two |
| Roman numerals | MDXXII |
| Binary (base 2) | 10111110010 |
| Octal (base 8) | 2762 |
| Hexadecimal (base 16) | 5F2 |
| Base 3 | 2002101 |
| As time | 1522 seconds = 25 min 22 s |
Is 1522 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1522 ÷ 2 = 761) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1522 a prime number?
No. 1522 = 2 × 761, so it is divisible by 2.
What are the factors of 1522?
1, 2, 761, 1522.
What is 1522 in binary?
10111110010 (hexadecimal 5F2, octal 2762).
What is the square root of 1522?
About 39.0128.
What is 1522 in Roman numerals?
MDXXII.
Is 1522 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 1522?
1522 is a semiprime: 2 × 761, the product of two primes.