Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …01110101011010101001011 |
3 | 2122121000102002200202002221 |
4 | 10212033113032223111023 |
5 | 10122241101113324321 |
6 | 111000541101234511 |
7 | 4154563665166261 |
oct | 446172716532513 |
9 | 78530362622087 |
10 | 20220022011211 |
11 | 6496299321640 |
12 | 2326938562a37 |
13 | b38980716509 |
14 | 4dc923514431 |
15 | 250e80e72e41 |
hex | 1263d73ab54b |
20220022011211 has 8 divisors (see below), whose sum is σ = 23355747350064. Its totient is φ = 17300553592320.
The previous prime is 20220022011209. The next prime is 20220022011229. The reversal of 20220022011211 is 11211022002202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20220022011211 - 21 = 20220022011209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20220022011271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54064229790 + ... + 54064230163.
It is an arithmetic number, because the mean of its divisors is an integer number (2919468418758).
Almost surely, 220220022011211 is an apocalyptic number.
20220022011211 is a deficient number, since it is larger than the sum of its proper divisors (3135725338853).
20220022011211 is a wasteful number, since it uses less digits than its factorization.
20220022011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108128459981.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20220022011211 its reverse (11211022002202), we get a palindrome (31431044013413).
Subtracting from 20220022011211 its reverse (11211022002202), we obtain a palindrome (9009000009009).
The spelling of 20220022011211 in words is "twenty trillion, two hundred twenty billion, twenty-two million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •