Base | Representation |
---|---|
bin | 1001001001010010000000… |
… | …00001011111000110010110 |
3 | 2122012111201012202102210120 |
4 | 10210221000001133012112 |
5 | 10113441001404324342 |
6 | 110434242451132410 |
7 | 4143623204125131 |
oct | 444510001370626 |
9 | 78174635672716 |
10 | 20110111011222 |
11 | 645371743a561 |
12 | 23095835a4106 |
13 | b2b4b57ab34b |
14 | 4d749809b218 |
15 | 24d19baaaaec |
hex | 124a4005f196 |
20110111011222 has 32 divisors (see below), whose sum is σ = 40251012303744. Its totient is φ = 6698240419200.
The previous prime is 20110111011217. The next prime is 20110111011227. The reversal of 20110111011222 is 22211011101102.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20110111011217) and next prime (20110111011227).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110111011227) 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, 45158653 + ... + 45601799.
It is an arithmetic number, because the mean of its divisors is an integer number (1257844134492).
Almost surely, 220110111011222 is an apocalyptic number.
20110111011222 is an abundant number, since it is smaller than the sum of its proper divisors (20140901292522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110111011222 is a wasteful number, since it uses less digits than its factorization.
20110111011222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448924.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20110111011222 its reverse (22211011101102), we get a palindrome (42321122112324).
The spelling of 20110111011222 in words is "twenty trillion, one hundred ten billion, one hundred eleven million, eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.263 sec. • engine limits •