Base | Representation |
---|---|
bin | 1001000110101110010001… |
… | …10110001101110000111011 |
3 | 2121220002211101200022000001 |
4 | 10203113020312031300323 |
5 | 10111020442312101021 |
6 | 110330024411053431 |
7 | 4134362040550426 |
oct | 443271066156073 |
9 | 77802741608001 |
10 | 20022212222011 |
11 | 641a41090420a |
12 | 22b4532441277 |
13 | b231180ac07c |
14 | 4d311a2829bd |
15 | 24ac54e35091 |
hex | 1235c8d8dc3b |
20022212222011 has 2 divisors, whose sum is σ = 20022212222012. Its totient is φ = 20022212222010.
The previous prime is 20022212222009. The next prime is 20022212222017. The reversal of 20022212222011 is 11022221222002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20022212222011 - 21 = 20022212222009 is a prime.
Together with 20022212222009, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 20022212222011.
It is not a weakly prime, because it can be changed into another prime (20022212222017) 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 as a sum of consecutive naturals, namely, 10011106111005 + 10011106111006.
It is an arithmetic number, because the mean of its divisors is an integer number (10011106111006).
Almost surely, 220022212222011 is an apocalyptic number.
20022212222011 is a deficient number, since it is larger than the sum of its proper divisors (1).
20022212222011 is an equidigital number, since it uses as much as digits as its factorization.
20022212222011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 20022212222011 its reverse (11022221222002), we get a palindrome (31044433444013).
The spelling of 20022212222011 in words is "twenty trillion, twenty-two billion, two hundred twelve million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •