Base | Representation |
---|---|
bin | 1001001001101000010110… |
… | …10001111011011011100011 |
3 | 2122020122200111220121021221 |
4 | 10210310023101323123203 |
5 | 10114140040410443021 |
6 | 110443545321155511 |
7 | 4144526445453433 |
oct | 444641321733343 |
9 | 78218614817257 |
10 | 20122111031011 |
11 | 6458815104a90 |
12 | 230b97232bb97 |
13 | b2c67894bb82 |
14 | 4d7cb5ac22c3 |
15 | 24d650332241 |
hex | 124d0b47b6e3 |
20122111031011 has 8 divisors (see below), whose sum is σ = 21952098315504. Its totient is φ = 18292241157120.
The previous prime is 20122111030961. The next prime is 20122111031047. The reversal of 20122111031011 is 11013011122102.
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 20122111031011 - 223 = 20122102642403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20122111031611) 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 7 ways as a sum of consecutive naturals, for example, 28994110 + ... + 29680003.
It is an arithmetic number, because the mean of its divisors is an integer number (2744012289438).
Almost surely, 220122111031011 is an apocalyptic number.
20122111031011 is a deficient number, since it is larger than the sum of its proper divisors (1829987284493).
20122111031011 is a wasteful number, since it uses less digits than its factorization.
20122111031011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58705301.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 20122111031011 its reverse (11013011122102), we get a palindrome (31135122153113).
The spelling of 20122111031011 in words is "twenty trillion, one hundred twenty-two billion, one hundred eleven million, thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •