Base | Representation |
---|---|
bin | 11101011011010101001… |
… | …010110001011100111001 |
3 | 21011022200100202120012012 |
4 | 131123111022301130321 |
5 | 231112442004000441 |
6 | 4144554011455305 |
7 | 266046162614324 |
oct | 35332512613471 |
9 | 7138610676165 |
10 | 2022211000121 |
11 | 70a684432a34 |
12 | 287b02457535 |
13 | 1189030224b0 |
14 | 6dc386777bb |
15 | 37907dd99eb |
hex | 1d6d52b1739 |
2022211000121 has 16 divisors (see below), whose sum is σ = 2183920341120. Its totient is φ = 1861388242560.
The previous prime is 2022211000003. The next prime is 2022211000127. The reversal of 2022211000121 is 1210001122202.
It is a cyclic number.
It is not a de Polignac number, because 2022211000121 - 234 = 2005031130937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2022211000096 and 2022211000105.
It is not an unprimeable number, because it can be changed into a prime (2022211000127) 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 in 15 ways as a sum of consecutive naturals, for example, 6483866 + ... + 6788588.
It is an arithmetic number, because the mean of its divisors is an integer number (136495021320).
Almost surely, 22022211000121 is an apocalyptic number.
It is an amenable number.
2022211000121 is a deficient number, since it is larger than the sum of its proper divisors (161709340999).
2022211000121 is a wasteful number, since it uses less digits than its factorization.
2022211000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306176.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2022211000121 its reverse (1210001122202), we get a palindrome (3232212122323).
The spelling of 2022211000121 in words is "two trillion, twenty-two billion, two hundred eleven million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.188 sec. • engine limits •