Base | Representation |
---|---|
bin | 1010000000100110110111… |
… | …10011110111010111000111 |
3 | 2212221020111102100112002121 |
4 | 11000103123303313113013 |
5 | 10341112213124343421 |
6 | 114451432043350411 |
7 | 4431151403646535 |
oct | 500233363672707 |
9 | 85836442315077 |
10 | 22011100231111 |
11 | 7016945285842 |
12 | 2575a94b22407 |
13 | c3883a4674a4 |
14 | 5614b302d155 |
15 | 28285c600d41 |
hex | 1404dbcf75c7 |
22011100231111 has 8 divisors (see below), whose sum is σ = 22479639669504. Its totient is φ = 21542569882680.
The previous prime is 22011100231103. The next prime is 22011100231121. The reversal of 22011100231111 is 11113200111022.
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 22011100231111 - 23 = 22011100231103 is a prime.
It is a super-2 number, since 2×220111002311112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011100231121) 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, 2738356 + ... + 7177798.
It is an arithmetic number, because the mean of its divisors is an integer number (2809954958688).
Almost surely, 222011100231111 is an apocalyptic number.
22011100231111 is a deficient number, since it is larger than the sum of its proper divisors (468539438393).
22011100231111 is a wasteful number, since it uses less digits than its factorization.
22011100231111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4544981.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 22011100231111 its reverse (11113200111022), we get a palindrome (33124300342133).
The spelling of 22011100231111 in words is "twenty-two trillion, eleven billion, one hundred million, two hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •