Base | Representation |
---|---|
bin | 1001000110000110111111… |
… | …10001110101000111011101 |
3 | 2121211002101120220200220011 |
4 | 10203003133301311013131 |
5 | 10110144244230040330 |
6 | 110312215540523221 |
7 | 4133014310561221 |
oct | 443033761650735 |
9 | 77732346820804 |
10 | 20001122111965 |
11 | 64114790053a5 |
12 | 22b04273b0511 |
13 | b21136907207 |
14 | 4d20b92b4781 |
15 | 24a41d63882a |
hex | 1230dfc751dd |
20001122111965 has 8 divisors (see below), whose sum is σ = 24003072960768. Its totient is φ = 15999746738640.
The previous prime is 20001122111963. The next prime is 20001122112029. The reversal of 20001122111965 is 56911122110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20001122111965 - 21 = 20001122111963 is a prime.
It is a super-2 number, since 2×200011221119652 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001122111963) 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, 143792401 + ... + 143931430.
It is an arithmetic number, because the mean of its divisors is an integer number (3000384120096).
Almost surely, 220001122111965 is an apocalyptic number.
It is an amenable number.
20001122111965 is a deficient number, since it is larger than the sum of its proper divisors (4001950848803).
20001122111965 is a wasteful number, since it uses less digits than its factorization.
20001122111965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287737739.
The product of its (nonzero) digits is 2160, while the sum is 31.
Adding to 20001122111965 its reverse (56911122110002), we get a palindrome (76912244221967).
The spelling of 20001122111965 in words is "twenty trillion, one billion, one hundred twenty-two million, one hundred eleven thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •