Base | Representation |
---|---|
bin | 10110110010010000111101… |
… | …000111000011110011000011 |
3 | 111010211002121222112111101020 |
4 | 112302100331013003303003 |
5 | 101113330020231223021 |
6 | 553044220223040523 |
7 | 30052010003255463 |
oct | 2662207507036303 |
9 | 433732558474336 |
10 | 100211202211011 |
11 | 29a26372169301 |
12 | b2a5728a40143 |
13 | 43bbb5023c238 |
14 | 1aa636899dba3 |
15 | b8bacb4277c6 |
hex | 5b243d1c3cc3 |
100211202211011 has 32 divisors (see below), whose sum is σ = 136197182592000. Its totient is φ = 65521771830528.
The previous prime is 100211202210997. The next prime is 100211202211091. The reversal of 100211202211011 is 110112202112001.
It is a happy number.
It is not a de Polignac number, because 100211202211011 - 218 = 100211201948867 is a prime.
It is a super-2 number, since 2×1002112022110112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100211202211091) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 174248550 + ... + 174822708.
It is an arithmetic number, because the mean of its divisors is an integer number (4256161956000).
Almost surely, 2100211202211011 is an apocalyptic number.
100211202211011 is a deficient number, since it is larger than the sum of its proper divisors (35985980380989).
100211202211011 is a wasteful number, since it uses less digits than its factorization.
100211202211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576523.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100211202211011 its reverse (110112202112001), we get a palindrome (210323404323012).
The spelling of 100211202211011 in words is "one hundred trillion, two hundred eleven billion, two hundred two million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •