Base | Representation |
---|---|
bin | 1001000110101100000010… |
… | …10101011000000100000111 |
3 | 2121212222201210001121022001 |
4 | 10203112001111120010013 |
5 | 10111011013140243421 |
6 | 110325305351250131 |
7 | 4134320231522656 |
oct | 443260125300407 |
9 | 77788653047261 |
10 | 20021012431111 |
11 | 641995563058a |
12 | 22b4258679947 |
13 | b22c8665bb23 |
14 | 4d3044ba919d |
15 | 24abd493b691 |
hex | 123581558107 |
20021012431111 has 8 divisors (see below), whose sum is σ = 20711488385024. Its totient is φ = 19333326279960.
The previous prime is 20021012431097. The next prime is 20021012431141. The reversal of 20021012431111 is 11113421012002.
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 20021012431111 - 27 = 20021012430983 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021012431141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 697436091 + ... + 697464796.
It is an arithmetic number, because the mean of its divisors is an integer number (2588936048128).
Almost surely, 220021012431111 is an apocalyptic number.
20021012431111 is a deficient number, since it is larger than the sum of its proper divisors (690475953913).
20021012431111 is a wasteful number, since it uses less digits than its factorization.
20021012431111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1394901381.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 20021012431111 its reverse (11113421012002), we get a palindrome (31134433443113).
The spelling of 20021012431111 in words is "twenty trillion, twenty-one billion, twelve million, four hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •