Base | Representation |
---|---|
bin | 1001001111101110000001… |
… | …01000110000111001110111 |
3 | 2122222122200002200012212001 |
4 | 10213313000220300321313 |
5 | 10131102011400423021 |
6 | 111124024214440131 |
7 | 4165613603426134 |
oct | 447670050607167 |
9 | 78878602605761 |
10 | 20331312123511 |
11 | 6529508726164 |
12 | 2344417363047 |
13 | b4630829897c |
14 | 50407dba358b |
15 | 253ce6456091 |
hex | 127dc0a30e77 |
20331312123511 has 2 divisors, whose sum is σ = 20331312123512. Its totient is φ = 20331312123510.
The previous prime is 20331312123431. The next prime is 20331312123547. The reversal of 20331312123511 is 11532121313302.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20331312123511 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20331312123511.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20331312129511) 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, 10165656061755 + 10165656061756.
It is an arithmetic number, because the mean of its divisors is an integer number (10165656061756).
Almost surely, 220331312123511 is an apocalyptic number.
20331312123511 is a deficient number, since it is larger than the sum of its proper divisors (1).
20331312123511 is an equidigital number, since it uses as much as digits as its factorization.
20331312123511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 20331312123511 its reverse (11532121313302), we get a palindrome (31863433436813).
The spelling of 20331312123511 in words is "twenty trillion, three hundred thirty-one billion, three hundred twelve million, one hundred twenty-three thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •