Base | Representation |
---|---|
bin | 1100010010011100100… |
… | …1001101001000011011 |
3 | 202011220121221100201211 |
4 | 3010213021031020123 |
5 | 11424323142401021 |
6 | 240552130323551 |
7 | 21152335300165 |
oct | 3044711151033 |
9 | 664817840654 |
10 | 211110122011 |
11 | 81593184318 |
12 | 34ab84295b7 |
13 | 16ba4cc2579 |
14 | a309859935 |
15 | 5758a173e1 |
hex | 312724d21b |
211110122011 has 8 divisors (see below), whose sum is σ = 220434649344. Its totient is φ = 201797746920.
The previous prime is 211110121979. The next prime is 211110122021. The reversal of 211110122011 is 110221011112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211110122011 - 25 = 211110121979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211110121982 and 211110122000.
It is not an unprimeable number, because it can be changed into a prime (211110122021) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3002541 + ... + 3072046.
It is an arithmetic number, because the mean of its divisors is an integer number (27554331168).
Almost surely, 2211110122011 is an apocalyptic number.
211110122011 is a deficient number, since it is larger than the sum of its proper divisors (9324527333).
211110122011 is a wasteful number, since it uses less digits than its factorization.
211110122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6076121.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 211110122011 its reverse (110221011112), we get a palindrome (321331133123).
The spelling of 211110122011 in words is "two hundred eleven billion, one hundred ten million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •