Base | Representation |
---|---|
bin | 1100001111100000110110… |
… | …11101101110110000110000 |
3 | 10112022122121210012110102021 |
4 | 12013300123131232300300 |
5 | 12012034323320233442 |
6 | 133131252020001224 |
7 | 5446000205363440 |
oct | 607603335566060 |
9 | 115278553173367 |
10 | 26921315789872 |
11 | 863a2a1a20749 |
12 | 3029646230214 |
13 | 120389128053a |
14 | 690dda38a120 |
15 | 31a442874e67 |
hex | 187c1b76ec30 |
26921315789872 has 320 divisors, whose sum is σ = 65344395976704. Its totient is φ = 10493115494400.
The previous prime is 26921315789833. The next prime is 26921315789917. The reversal of 26921315789872 is 27898751312962.
It is a super-2 number, since 2×269213157898722 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3140240178 + ... + 3140248750.
Almost surely, 226921315789872 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 26921315789872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32672197988352).
26921315789872 is an abundant number, since it is smaller than the sum of its proper divisors (38423080186832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26921315789872 is a wasteful number, since it uses less digits than its factorization.
26921315789872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9396 (or 9390 counting only the distinct ones).
The product of its digits is 182891520, while the sum is 70.
The spelling of 26921315789872 in words is "twenty-six trillion, nine hundred twenty-one billion, three hundred fifteen million, seven hundred eighty-nine thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •