Base | Representation |
---|---|
bin | 10110110010010000110001… |
… | …101110011100111011111101 |
3 | 111010211002010200010200121221 |
4 | 112302100301232130323331 |
5 | 101113324122332223010 |
6 | 553044145241153341 |
7 | 30052002163634242 |
oct | 2662206156347375 |
9 | 433732120120557 |
10 | 100211011211005 |
11 | 29a26284373162 |
12 | b2a5694a8b851 |
13 | 43bbb1c7b6596 |
14 | 1aa634b4815c9 |
15 | b8bab9799dda |
hex | 5b2431b9cefd |
100211011211005 has 16 divisors (see below), whose sum is σ = 125609265872640. Its totient is φ = 76605199124608.
The previous prime is 100211011210931. The next prime is 100211011211033. The reversal of 100211011211005 is 500112110112001.
It is a cyclic number.
It is not a de Polignac number, because 100211011211005 - 235 = 100176651472637 is a prime.
It is a super-2 number, since 2×1002110112110052 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100211011211005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 443122000 + ... + 443348089.
It is an arithmetic number, because the mean of its divisors is an integer number (7850579117040).
Almost surely, 2100211011211005 is an apocalyptic number.
It is an amenable number.
100211011211005 is a deficient number, since it is larger than the sum of its proper divisors (25398254661635).
100211011211005 is an equidigital number, since it uses as much as digits as its factorization.
100211011211005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 886471100.
The product of its (nonzero) digits is 20, while the sum is 16.
Adding to 100211011211005 its reverse (500112110112001), we get a palindrome (600323121323006).
The spelling of 100211011211005 in words is "one hundred trillion, two hundred eleven billion, eleven million, two hundred eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •