Base | Representation |
---|---|
bin | 1001001100100000110000… |
… | …01001010011100100100011 |
3 | 2122121010020000001022112101 |
4 | 10212100120021103210203 |
5 | 10122300313421402321 |
6 | 111001241124511231 |
7 | 4154632661401066 |
oct | 446203011234443 |
9 | 78533200038471 |
10 | 20221111122211 |
11 | 64967a807987a |
12 | 2326ba124b517 |
13 | b38ac5253aac |
14 | 4dc9c801a8dd |
15 | 250ee68a7791 |
hex | 126418253923 |
20221111122211 has 8 divisors (see below), whose sum is σ = 20293825616064. Its totient is φ = 20148441094440.
The previous prime is 20221111122203. The next prime is 20221111122221. The reversal of 20221111122211 is 11222111112202.
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 20221111122211 - 23 = 20221111122203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20221111122221) 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, 10205245 + ... + 12024526.
It is an arithmetic number, because the mean of its divisors is an integer number (2536728202008).
Almost surely, 220221111122211 is an apocalyptic number.
20221111122211 is a deficient number, since it is larger than the sum of its proper divisors (72714493853).
20221111122211 is a wasteful number, since it uses less digits than its factorization.
20221111122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22233041.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 20221111122211 its reverse (11222111112202), we get a palindrome (31443222234413).
The spelling of 20221111122211 in words is "twenty trillion, two hundred twenty-one billion, one hundred eleven million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •