Base | Representation |
---|---|
bin | 1001000110001011100001… |
… | …10010111111000011011011 |
3 | 2121211022200011000212022101 |
4 | 10203011300302333003123 |
5 | 10110214240102024011 |
6 | 110313301212304231 |
7 | 4133131512664234 |
oct | 443056062770333 |
9 | 77738604025271 |
10 | 20003555111131 |
11 | 6412507406709 |
12 | 22b09a6172077 |
13 | b214339a7ca7 |
14 | 4d226a48408b |
15 | 24a51202c2c1 |
hex | 123170cbf0db |
20003555111131 has 2 divisors, whose sum is σ = 20003555111132. Its totient is φ = 20003555111130.
The previous prime is 20003555111129. The next prime is 20003555111207. The reversal of 20003555111131 is 13111155530002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20003555111131 - 21 = 20003555111129 is a prime.
It is a super-2 number, since 2×200035551111312 (a number of 27 digits) contains 22 as substring.
Together with 20003555111129, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 20003555111131.
It is not a weakly prime, because it can be changed into another prime (20003555111431) 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 as a sum of consecutive naturals, namely, 10001777555565 + 10001777555566.
It is an arithmetic number, because the mean of its divisors is an integer number (10001777555566).
Almost surely, 220003555111131 is an apocalyptic number.
20003555111131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20003555111131 is an equidigital number, since it uses as much as digits as its factorization.
20003555111131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2250, while the sum is 28.
The spelling of 20003555111131 in words is "twenty trillion, three billion, five hundred fifty-five million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •