The number 5268
5268 is a composite number with 12 divisors. Its prime factorisation is × 3 × 439. Divisors (12): 1, 2, 3, 4, 6, 12, 439, 878, 1317, 1756, 2634, 5268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5268: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
5268 is composite. Its prime factorisation is
- 3
The divisors add up to 12320; without 5268 itself that is 7052, so 5268 is abundant (7052 is more than 5268). Euler's totient φ(5268) = 1752 numbers up to 5268 share no factor with it.
- 4
The digits of 5268 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5268 = 2^{2} \times 3 \times 439 \]5268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 12320 |
| Euler totient φ(n) | 1752 |
| Square | 27751824 |
| Cube | 146196608832 |
| Square root | 72.580989 (= 2√1317) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 54 |
| Scientific notation | 5.268 × |
5268 in other forms
| Form | Value |
|---|---|
| In words | five thousand two hundred and sixty-eight |
| Binary (base 2) | 1010010010100 |
| Octal (base 8) | 12224 |
| Hexadecimal (base 16) | 1494 |
| Base 3 | 21020010 |
| As time | 5268 seconds = 1 h 27 min 48 s |
Is 5268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5268 ÷ 2 = 2634) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5268 ÷ 3 = 1756) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5268 ÷ 4 = 1317) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (5268 ÷ 6 = 878) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5268 ÷ 12 = 439) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5268 a prime number?
No. 5268 = × 3 × 439, so it is divisible by 2.
What are the factors of 5268?
1, 2, 3, 4, 6, 12, 439, 878, 1317, 1756, 2634, 5268.
What is 5268 in binary?
1010010010100 (hexadecimal 1494, octal 12224).
What is the square root of 5268?
About 72.5810, exactly 2√1317.
Is 5268 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 5268?
5268 is a happy number: repeatedly adding the squares of its digits reaches 1.