The number 26152
26152 is a composite number with 16 divisors. Its prime factorisation is × 7 × 467. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 467, 934, 1868, 3269, 3736, 6538, 13076, 26152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 26152: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
26152 is composite. Its prime factorisation is
- 3
The divisors add up to 56160; without 26152 itself that is 30008, so 26152 is abundant (30008 is more than 26152). Euler's totient φ(26152) = 11184 numbers up to 26152 share no factor with it.
- 4
The digits of 26152 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 46 steps to reach 1.
LaTeX source of the formulas on this page
\[ 26152 = 2^{3} \times 7 \times 467 \]26152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 56160 |
| Euler totient φ(n) | 11184 |
| Square | 683927104 |
| Cube | 17886061623808 |
| Square root | 161.715800 (= 2√6538) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 46 |
| Scientific notation | 2.6152 × |
26152 in other forms
| Form | Value |
|---|---|
| In words | twenty-six thousand one hundred and fifty-two |
| Binary (base 2) | 110011000101000 |
| Octal (base 8) | 63050 |
| Hexadecimal (base 16) | 6628 |
| Base 3 | 1022212121 |
| As time | 26152 seconds = 7 h 15 min 52 s |
Is 26152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (26152 ÷ 2 = 13076) | 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 (26152 ÷ 4 = 6538) | 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 | Yes (26152 ÷ 7 = 3736) | 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 | Yes (26152 ÷ 8 = 3269) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 5) | 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 26152 a prime number?
No. 26152 = × 7 × 467, so it is divisible by 2.
What are the factors of 26152?
1, 2, 4, 7, 8, 14, 28, 56, 467, 934, 1868, 3269, 3736, 6538, 13076, 26152.
What is 26152 in binary?
110011000101000 (hexadecimal 6628, octal 63050).
What is the square root of 26152?
About 161.7158, exactly 2√6538.
Is 26152 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 26152?
26152 is a happy number: repeatedly adding the squares of its digits reaches 1.