The number 52669
52669 is a composite number with 4 divisors. Its prime factorisation is 31 × 1699. Divisors (4): 1, 31, 1699, 52669.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52669: a semiprime: 31 × 1699, the product of two primes.
- 2
52669 is composite. Its prime factorisation is
- 3
The divisors add up to 54400; without 52669 itself that is 1731, so 52669 is deficient (1731 is less than 52669). Euler's totient φ(52669) = 50940 numbers up to 52669 share no factor with it.
- 4
The digits of 52669 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52669 = 31 \times 1699 \]
52669 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54400 |
| Euler totient φ(n) | 50940 |
| Square | 2774023561 |
| Cube | 146105046934309 |
| Square root | 229.497277 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.2669 × |
52669 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand six hundred and sixty-nine |
| Binary (base 2) | 1100110110111101 |
| Octal (base 8) | 146675 |
| Hexadecimal (base 16) | CDBD |
| Base 3 | 2200020201 |
| As time | 52669 seconds = 14 h 37 min 49 s |
Is 52669 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 1) | 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 1) | 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 1) | 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 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52669 a prime number?
No. 52669 = 31 × 1699, so it is divisible by 31.
What are the factors of 52669?
1, 31, 1699, 52669.
What is 52669 in binary?
1100110110111101 (hexadecimal CDBD, octal 146675).
What is the square root of 52669?
About 229.4973.
Is 52669 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 52669?
52669 is a semiprime: 31 × 1699, the product of two primes.