The number 15268
15268 is a composite number with 12 divisors. Its prime factorisation is × 11 × 347. Divisors (12): 1, 2, 4, 11, 22, 44, 347, 694, 1388, 3817, 7634, 15268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15268: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 22.
- 2
15268 is composite. Its prime factorisation is
- 3
The divisors add up to 29232; without 15268 itself that is 13964, so 15268 is deficient (13964 is less than 15268). Euler's totient φ(15268) = 6920 numbers up to 15268 share no factor with it.
- 4
The digits of 15268 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15268 = 2^{2} \times 11 \times 347 \]15268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 29232 |
| Euler totient φ(n) | 6920 |
| Square | 233111824 |
| Cube | 3559151328832 |
| Square root | 123.563749 (= 2√3817) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5268 × |
15268 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand two hundred and sixty-eight |
| Binary (base 2) | 11101110100100 |
| Octal (base 8) | 35644 |
| Hexadecimal (base 16) | 3BA4 |
| Base 3 | 202221111 |
| As time | 15268 seconds = 4 h 14 min 28 s |
Is 15268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15268 ÷ 2 = 7634) | 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 | Yes (15268 ÷ 4 = 3817) | 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 | No (remainder 4) | 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 4) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15268 ÷ 11 = 1388) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15268 a prime number?
No. 15268 = × 11 × 347, so it is divisible by 2.
What are the factors of 15268?
1, 2, 4, 11, 22, 44, 347, 694, 1388, 3817, 7634, 15268.
What is 15268 in binary?
11101110100100 (hexadecimal 3BA4, octal 35644).
What is the square root of 15268?
About 123.5637, exactly 2√3817.
Is 15268 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 15268?
15268 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 22.