Base | Representation |
---|---|
bin | 1001001100100010011100… |
… | …11100011100111110011011 |
3 | 2122121012120111020100101202 |
4 | 10212101032130130332123 |
5 | 10122304200130024011 |
6 | 111001511350304415 |
7 | 4154664362565341 |
oct | 446211634347633 |
9 | 78535514210352 |
10 | 20222022111131 |
11 | 6497125327285 |
12 | 23271b635810b |
13 | b38c0bbc71a9 |
14 | 4dca72dd7991 |
15 | 25104b85523b |
hex | 12644e71cf9b |
20222022111131 has 8 divisors (see below), whose sum is σ = 20873373787728. Its totient is φ = 19578200512000.
The previous prime is 20222022111121. The next prime is 20222022111133. The reversal of 20222022111131 is 13111122022202.
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 20222022111131 - 222 = 20222017916827 is a prime.
It is a super-2 number, since 2×202220221111312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20222022111133) 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, 1882513910 + ... + 1882524651.
It is an arithmetic number, because the mean of its divisors is an integer number (2609171723466).
Almost surely, 220222022111131 is an apocalyptic number.
20222022111131 is a deficient number, since it is larger than the sum of its proper divisors (651351676597).
20222022111131 is a wasteful number, since it uses less digits than its factorization.
20222022111131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3765038733.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 20222022111131 its reverse (13111122022202), we get a palindrome (33333144133333).
The spelling of 20222022111131 in words is "twenty trillion, two hundred twenty-two billion, twenty-two million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •