Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …11000101000110110110101 |
3 | 2122121012120102100112210001 |
4 | 10212101032120220312311 |
5 | 10122304144401024341 |
6 | 111001511313031301 |
7 | 4154664351232216 |
oct | 446211630506665 |
9 | 78535512315701 |
10 | 20222021111221 |
11 | 6497124804006 |
12 | 23271b5b55531 |
13 | b38c0b937027 |
14 | 4dca72c1740d |
15 | 25104b708d31 |
hex | 12644e628db5 |
20222021111221 has 2 divisors, whose sum is σ = 20222021111222. Its totient is φ = 20222021111220.
The previous prime is 20222021111177. The next prime is 20222021111231. The reversal of 20222021111221 is 12211112022202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20222010678321 + 10432900 = 4496889^2 + 3230^2 .
It is a cyclic number.
It is not a de Polignac number, because 20222021111221 - 213 = 20222021103029 is a prime.
It is a super-2 number, since 2×202220211112212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20222021111231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10111010555610 + 10111010555611.
It is an arithmetic number, because the mean of its divisors is an integer number (10111010555611).
Almost surely, 220222021111221 is an apocalyptic number.
It is an amenable number.
20222021111221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20222021111221 is an equidigital number, since it uses as much as digits as its factorization.
20222021111221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 20222021111221 its reverse (12211112022202), we get a palindrome (32433133133423).
The spelling of 20222021111221 in words is "twenty trillion, two hundred twenty-two billion, twenty-one million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •