The number 26483
26483 is a binary palindrome (110011101110011). Its prime factorisation is 71 × 373. Divisors (4): 1, 71, 373, 26483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 26483: a binary palindrome (110011101110011); a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 373, the product of two primes.
- 2
26483 is composite. Its prime factorisation is
- 3
The divisors add up to 26928; without 26483 itself that is 445, so 26483 is deficient (445 is less than 26483). Euler's totient φ(26483) = 26040 numbers up to 26483 share no factor with it.
- 4
The digits of 26483 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 121 steps to reach 1.
LaTeX source of the formulas on this page
\[ 26483 = 71 \times 373 \]
26483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 26928 |
| Euler totient φ(n) | 26040 |
| Square | 701349289 |
| Cube | 18573833220587 |
| Square root | 162.735982 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 121 |
| Scientific notation | 2.6483 × |
26483 in other forms
| Form | Value |
|---|---|
| In words | twenty-six thousand four hundred and eighty-three |
| Binary (base 2) | 110011101110011 |
| Octal (base 8) | 63563 |
| Hexadecimal (base 16) | 6773 |
| Base 3 | 1100022212 |
| As time | 26483 seconds = 7 h 21 min 23 s |
Is 26483 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 26483 a prime number?
No. 26483 = 71 × 373, so it is divisible by 71.
What are the factors of 26483?
1, 71, 373, 26483.
What is 26483 in binary?
110011101110011 (hexadecimal 6773, octal 63563).
What is the square root of 26483?
About 162.7360.
Is 26483 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 26483?
26483 is a binary palindrome (110011101110011); a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 373, the product of two primes.