Base | Representation |
---|---|
bin | 1001001100100010100110… |
… | …01110000101010000000101 |
3 | 2122121012210001222210212001 |
4 | 10212101103032011100011 |
5 | 10122304331132330041 |
6 | 111001523331425301 |
7 | 4154666354565166 |
oct | 446212316052005 |
9 | 78535701883761 |
10 | 20222102230021 |
11 | 649716657983a |
12 | 2327219155231 |
13 | b38c22699713 |
14 | 4dca7d8d176d |
15 | 2510538ce131 |
hex | 126453385405 |
20222102230021 has 2 divisors, whose sum is σ = 20222102230022. Its totient is φ = 20222102230020.
The previous prime is 20222102230013. The next prime is 20222102230069. The reversal of 20222102230021 is 12003220122202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18957577240900 + 1264524989121 = 4354030^2 + 1124511^2 .
It is a cyclic number.
It is not a de Polignac number, because 20222102230021 - 23 = 20222102230013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20222102230081) 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 as a sum of consecutive naturals, namely, 10111051115010 + 10111051115011.
It is an arithmetic number, because the mean of its divisors is an integer number (10111051115011).
Almost surely, 220222102230021 is an apocalyptic number.
It is an amenable number.
20222102230021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20222102230021 is an equidigital number, since it uses as much as digits as its factorization.
20222102230021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 20222102230021 its reverse (12003220122202), we get a palindrome (32225322352223).
The spelling of 20222102230021 in words is "twenty trillion, two hundred twenty-two billion, one hundred two million, two hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •