Base | Representation |
---|---|
bin | 1001000110101110000110… |
… | …11010001111000000110011 |
3 | 2121220002121001000210022111 |
4 | 10203113003122033000303 |
5 | 10111020300434013021 |
6 | 110330011351550151 |
7 | 4134356552311123 |
oct | 443270332170063 |
9 | 77802531023274 |
10 | 20022121001011 |
11 | 641a374369558 |
12 | 22b450798b357 |
13 | b2310222044c |
14 | 4d310c0d8c83 |
15 | 24ac4be168e1 |
hex | 1235c368f033 |
20022121001011 has 2 divisors, whose sum is σ = 20022121001012. Its totient is φ = 20022121001010.
The previous prime is 20022121000997. The next prime is 20022121001137. The reversal of 20022121001011 is 11010012122002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20022121001011 - 27 = 20022121000883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20022121000982 and 20022121001000.
It is not a weakly prime, because it can be changed into another prime (20022121041011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10011060500505 + 10011060500506.
It is an arithmetic number, because the mean of its divisors is an integer number (10011060500506).
Almost surely, 220022121001011 is an apocalyptic number.
20022121001011 is a deficient number, since it is larger than the sum of its proper divisors (1).
20022121001011 is an equidigital number, since it uses as much as digits as its factorization.
20022121001011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20022121001011 its reverse (11010012122002), we get a palindrome (31032133123013).
The spelling of 20022121001011 in words is "twenty trillion, twenty-two billion, one hundred twenty-one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •