Base | Representation |
---|---|
bin | 11001000011001010… |
… | …100100000110101000 |
3 | 2120102110210012210010 |
4 | 121003022210012220 |
5 | 420041020142233 |
6 | 20204532251520 |
7 | 1641344503131 |
oct | 310312440650 |
9 | 76373705703 |
10 | 26896646568 |
11 | 10452501730 |
12 | 5267770ba0 |
13 | 26c84648ac |
14 | 143221ac88 |
15 | a7646bb63 |
hex | 6432a41a8 |
26896646568 has 256 divisors, whose sum is σ = 78606028800. Its totient is φ = 7589120000.
The previous prime is 26896646533. The next prime is 26896646633. The reversal of 26896646568 is 86564669862.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a junction number, because it is equal to n+sod(n) for n = 26896646499 and 26896646508.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 38368618 + ... + 38369318.
It is an arithmetic number, because the mean of its divisors is an integer number (307054800).
Almost surely, 226896646568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 26896646568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39303014400).
26896646568 is an abundant number, since it is smaller than the sum of its proper divisors (51709382232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26896646568 is a wasteful number, since it uses less digits than its factorization.
26896646568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 904 (or 900 counting only the distinct ones).
The product of its digits is 179159040, while the sum is 66.
The spelling of 26896646568 in words is "twenty-six billion, eight hundred ninety-six million, six hundred forty-six thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •