Base | Representation |
---|---|
bin | 1011110101100001100000… |
… | …01101001000000000101100 |
3 | 10102011021121201022120001022 |
4 | 11322300300031020000230 |
5 | 11402421440000421222 |
6 | 131205124002433312 |
7 | 5324324541233210 |
oct | 572606015100054 |
9 | 112137551276038 |
10 | 26028310560812 |
11 | 83255a983388a |
12 | 2b04564662838 |
13 | 116a5c79b9261 |
14 | 65dac3d5c940 |
15 | 3020c947d042 |
hex | 17ac3034802c |
26028310560812 has 96 divisors (see below), whose sum is σ = 55062540288000. Its totient is φ = 10516626066240.
The previous prime is 26028310560809. The next prime is 26028310560839. The reversal of 26028310560812 is 21806501382062.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 192052889 + ... + 192188367.
It is an arithmetic number, because the mean of its divisors is an integer number (573568128000).
Almost surely, 226028310560812 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 26028310560812, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27531270144000).
26028310560812 is an abundant number, since it is smaller than the sum of its proper divisors (29034229727188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26028310560812 is a wasteful number, since it uses less digits than its factorization.
26028310560812 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137259 (or 137257 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 44.
The spelling of 26028310560812 in words is "twenty-six trillion, twenty-eight billion, three hundred ten million, five hundred sixty thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •