Base | Representation |
---|---|
bin | 1001001001010100010001… |
… | …01111011101010111101001 |
3 | 2122012121212020102102101112 |
4 | 10210222020233131113221 |
5 | 10114001001220203223 |
6 | 110435003512200105 |
7 | 4143665350056566 |
oct | 444521057352751 |
9 | 78177766372345 |
10 | 20111331022313 |
11 | 6454193073993 |
12 | 2309864099035 |
13 | b2b64b48acbb |
14 | 4d757211986d |
15 | 24d21dc4a778 |
hex | 124a88bdd5e9 |
20111331022313 has 8 divisors (see below), whose sum is σ = 20760147154176. Its totient is φ = 19462518860400.
The previous prime is 20111331022207. The next prime is 20111331022339. The reversal of 20111331022313 is 31322013311102.
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 20111331022313 - 210 = 20111331021289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20111331522313) 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 7 ways as a sum of consecutive naturals, for example, 12004523 + ... + 13576863.
It is an arithmetic number, because the mean of its divisors is an integer number (2595018394272).
Almost surely, 220111331022313 is an apocalyptic number.
It is an amenable number.
20111331022313 is a deficient number, since it is larger than the sum of its proper divisors (648816131863).
20111331022313 is a wasteful number, since it uses less digits than its factorization.
20111331022313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1984975.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 20111331022313 its reverse (31322013311102), we get a palindrome (51433344333415).
The spelling of 20111331022313 in words is "twenty trillion, one hundred eleven billion, three hundred thirty-one million, twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •