The number 5269
5269 is a composite number with 4 divisors. Its prime factorisation is 11 × 479. Divisors (4): 1, 11, 479, 5269.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5269: a semiprime: 11 × 479, the product of two primes.
- 2
5269 is composite. Its prime factorisation is
- 3
The divisors add up to 5760; without 5269 itself that is 491, so 5269 is deficient (491 is less than 5269). Euler's totient φ(5269) = 4780 numbers up to 5269 share no factor with it.
- 4
The digits of 5269 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5269 = 11 \times 479 \]
5269 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5760 |
| Euler totient φ(n) | 4780 |
| Square | 27762361 |
| Cube | 146279880109 |
| Square root | 72.587878 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 54 |
| Scientific notation | 5.269 × |
5269 in other forms
| Form | Value |
|---|---|
| In words | five thousand two hundred and sixty-nine |
| Binary (base 2) | 1010010010101 |
| Octal (base 8) | 12225 |
| Hexadecimal (base 16) | 1495 |
| Base 3 | 21020011 |
| As time | 5269 seconds = 1 h 27 min 49 s |
Is 5269 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 5) | 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 4) | 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 (5269 ÷ 11 = 479) | 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 5269 a prime number?
No. 5269 = 11 × 479, so it is divisible by 11.
What are the factors of 5269?
1, 11, 479, 5269.
What is 5269 in binary?
1010010010101 (hexadecimal 1495, octal 12225).
What is the square root of 5269?
About 72.5879.
Is 5269 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 5269?
5269 is a semiprime: 11 × 479, the product of two primes.