Base | Representation |
---|---|
bin | 1001001001010010001101… |
… | …01000111000100000100011 |
3 | 2122012111222221121100210221 |
4 | 10210221012220320200203 |
5 | 10113441213313032321 |
6 | 110434301454103511 |
7 | 4143626022415045 |
oct | 444510650704043 |
9 | 78174887540727 |
10 | 20110222002211 |
11 | 6453774058750 |
12 | 23095b47aab97 |
13 | b2b50279c7a3 |
14 | 4d74a8b0da95 |
15 | 24d1a66d1e41 |
hex | 124a46a38823 |
20110222002211 has 16 divisors (see below), whose sum is σ = 23630728808448. Its totient is φ = 16923047961600.
The previous prime is 20110222002187. The next prime is 20110222002223. The reversal of 20110222002211 is 11220022201102.
It is a happy number.
It is not a de Polignac number, because 20110222002211 - 233 = 20101632067619 is a prime.
It is a super-2 number, since 2×201102220022112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20110222002011) 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 15 ways as a sum of consecutive naturals, for example, 1282041246 + ... + 1282056931.
It is an arithmetic number, because the mean of its divisors is an integer number (1476920550528).
Almost surely, 220110222002211 is an apocalyptic number.
20110222002211 is a deficient number, since it is larger than the sum of its proper divisors (3520506806237).
20110222002211 is a wasteful number, since it uses less digits than its factorization.
20110222002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2564098242.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20110222002211 its reverse (11220022201102), we get a palindrome (31330244203313).
The spelling of 20110222002211 in words is "twenty trillion, one hundred ten billion, two hundred twenty-two million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •