Base | Representation |
---|---|
bin | 1001001001010101100011… |
… | …11011110010011100010011 |
3 | 2122012200122101211211110222 |
4 | 10210222301323302130103 |
5 | 10114003410130321321 |
6 | 110435200240543255 |
7 | 4144021441233350 |
oct | 444526173623423 |
9 | 78180571754428 |
10 | 20112022120211 |
11 | 6454508192a7a |
12 | 2309a17621b2b |
13 | b2b72b701478 |
14 | 4d75d9c17627 |
15 | 24d25e7603ab |
hex | 124ab1ef2713 |
20112022120211 has 32 divisors (see below), whose sum is σ = 24078442088448. Its totient is φ = 16424804816640.
The previous prime is 20112022120129. The next prime is 20112022120219. The reversal of 20112022120211 is 11202122021102.
It is a cyclic number.
It is not a de Polignac number, because 20112022120211 - 210 = 20112022119187 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20112022120211.
It is not an unprimeable number, because it can be changed into a prime (20112022120219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 472568945 + ... + 472611501.
It is an arithmetic number, because the mean of its divisors is an integer number (752451315264).
Almost surely, 220112022120211 is an apocalyptic number.
20112022120211 is a deficient number, since it is larger than the sum of its proper divisors (3966419968237).
20112022120211 is a wasteful number, since it uses less digits than its factorization.
20112022120211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54011.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20112022120211 its reverse (11202122021102), we get a palindrome (31314144141313).
The spelling of 20112022120211 in words is "twenty trillion, one hundred twelve billion, twenty-two million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •