Base | Representation |
---|---|
bin | 1010000000010010011010… |
… | …11001011011010000110011 |
3 | 2212220012011020222211210202 |
4 | 11000021031121123100303 |
5 | 10340422221434013021 |
6 | 114442414400345415 |
7 | 4430312336020406 |
oct | 500111531332063 |
9 | 85805136884722 |
10 | 22000121001011 |
11 | 701222084375a |
12 | 257393001526b |
13 | c377aa93282a |
14 | 560b50c07d3d |
15 | 2824187b5a0b |
hex | 14024d65b433 |
22000121001011 has 2 divisors, whose sum is σ = 22000121001012. Its totient is φ = 22000121001010.
The previous prime is 22000121000951. The next prime is 22000121001029. The reversal of 22000121001011 is 11010012100022.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22000121001011 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 22000121000983 and 22000121001001.
It is not a weakly prime, because it can be changed into another prime (22000121001071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11000060500505 + 11000060500506.
It is an arithmetic number, because the mean of its divisors is an integer number (11000060500506).
Almost surely, 222000121001011 is an apocalyptic number.
22000121001011 is a deficient number, since it is larger than the sum of its proper divisors (1).
22000121001011 is an equidigital number, since it uses as much as digits as its factorization.
22000121001011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 22000121001011 its reverse (11010012100022), we get a palindrome (33010133101033).
It can be divided in two parts, 2200012 and 1001011, that added together give a palindrome (3201023).
The spelling of 22000121001011 in words is "twenty-two trillion, one hundred twenty-one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •