Base | Representation |
---|---|
bin | 11000011010100111… |
… | …010110101110100000 |
3 | 2111200001122110021200 |
4 | 120122213112232200 |
5 | 412142334444341 |
6 | 20013230521200 |
7 | 1615444053300 |
oct | 303247265640 |
9 | 74601573250 |
10 | 26216328096 |
11 | 10133485362 |
12 | 50b7966200 |
13 | 261a52699a |
14 | 13a9b27600 |
15 | a36885db6 |
hex | 61a9d6ba0 |
26216328096 has 648 divisors, whose sum is σ = 94583492640. Its totient is φ = 6852916224.
The previous prime is 26216328091. The next prime is 26216328097. The reversal of 26216328096 is 69082361262.
26216328096 is a `hidden beast` number, since 2 + 6 + 2 + 1 + 632 + 8 + 0 + 9 + 6 = 666.
It is not an unprimeable number, because it can be changed into a prime (26216328091) by changing a digit.
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 107 ways as a sum of consecutive naturals, for example, 444344515 + ... + 444344573.
It is an arithmetic number, because the mean of its divisors is an integer number (145962180).
Almost surely, 226216328096 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 26216328096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47291746320).
26216328096 is an abundant number, since it is smaller than the sum of its proper divisors (68367164544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26216328096 is a wasteful number, since it uses less digits than its factorization.
26216328096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186 (or 131 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 45.
The spelling of 26216328096 in words is "twenty-six billion, two hundred sixteen million, three hundred twenty-eight thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •