Base | Representation |
---|---|
bin | 11001111111010101… |
… | …100010011001000000 |
3 | 2200000211100121111220 |
4 | 121333111202121000 |
5 | 424122433443341 |
6 | 20453033435040 |
7 | 2005353261450 |
oct | 317725423100 |
9 | 80024317456 |
10 | 27906156096 |
11 | 10920330125 |
12 | 54a986ba80 |
13 | 2829651300 |
14 | 14ca321d60 |
15 | ad4dcaa66 |
hex | 67f562640 |
27906156096 has 168 divisors, whose sum is σ = 91373943744. Its totient is φ = 7359805440.
The previous prime is 27906156067. The next prime is 27906156127. The reversal of 27906156096 is 69065160972.
It is a tau number, because it is divible by the number of its divisors (168).
It is a super-2 number, since 2×279061560962 (a number of 22 digits) contains 22 as substring.
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 23 ways as a sum of consecutive naturals, for example, 165706 + ... + 288566.
Almost surely, 227906156096 is an apocalyptic number.
27906156096 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27906156096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45686971872).
27906156096 is an abundant number, since it is smaller than the sum of its proper divisors (63467787648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27906156096 is a wasteful number, since it uses less digits than its factorization.
27906156096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122909 (or 122886 counting only the distinct ones).
The product of its (nonzero) digits is 1224720, while the sum is 51.
The spelling of 27906156096 in words is "twenty-seven billion, nine hundred six million, one hundred fifty-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •