Base | Representation |
---|---|
bin | 1001001111101110000010… |
… | …10010101011011001100011 |
3 | 2122222122200212100102212111 |
4 | 10213313001102223121203 |
5 | 10131102022204023021 |
6 | 111124025250140151 |
7 | 4165614066010513 |
oct | 447670122533143 |
9 | 78878625312774 |
10 | 20331323111011 |
11 | 6529513950240 |
12 | 234441ab81657 |
13 | b4630a644b53 |
14 | 504081423843 |
15 | 253ce73c68e1 |
hex | 127dc14ab663 |
20331323111011 has 4 divisors (see below), whose sum is σ = 22179625212024. Its totient is φ = 18483021010000.
The previous prime is 20331323110991. The next prime is 20331323111027. The reversal of 20331323111011 is 11011132313302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20331323111011 - 211 = 20331323108963 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20331323111041) 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 in 3 ways as a sum of consecutive naturals, for example, 924151050490 + ... + 924151050511.
It is an arithmetic number, because the mean of its divisors is an integer number (5544906303006).
Almost surely, 220331323111011 is an apocalyptic number.
20331323111011 is a deficient number, since it is larger than the sum of its proper divisors (1848302101013).
20331323111011 is a wasteful number, since it uses less digits than its factorization.
20331323111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1848302101012.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 20331323111011 its reverse (11011132313302), we get a palindrome (31342455424313).
The spelling of 20331323111011 in words is "twenty trillion, three hundred thirty-one billion, three hundred twenty-three million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •