Base | Representation |
---|---|
bin | 100110001110111001001… |
… | …100001110110010011001 |
3 | 100022011121021200211101010 |
4 | 212032321030032302121 |
5 | 321021233443242423 |
6 | 5330551335044133 |
7 | 360550510412610 |
oct | 46167114166231 |
9 | 10264537624333 |
10 | 2627332009113 |
11 | 923277474369 |
12 | 365240210649 |
13 | 1609aa8c9826 |
14 | 91240abc877 |
15 | 48522613693 |
hex | 263b930ec99 |
2627332009113 has 8 divisors (see below), whose sum is σ = 4003553537728. Its totient is φ = 1501332576624.
The previous prime is 2627332009111. The next prime is 2627332009147. The reversal of 2627332009113 is 3119002337262.
2627332009113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2627332009113 - 21 = 2627332009111 is a prime.
It is a super-2 number, since 2×26273320091132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2627332009111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62555524006 + ... + 62555524047.
It is an arithmetic number, because the mean of its divisors is an integer number (500444192216).
Almost surely, 22627332009113 is an apocalyptic number.
It is an amenable number.
2627332009113 is a deficient number, since it is larger than the sum of its proper divisors (1376221528615).
2627332009113 is a wasteful number, since it uses less digits than its factorization.
2627332009113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125111048063.
The product of its (nonzero) digits is 81648, while the sum is 39.
The spelling of 2627332009113 in words is "two trillion, six hundred twenty-seven billion, three hundred thirty-two million, nine thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •