Base | Representation |
---|---|
bin | 1001001001010110000111… |
… | …10000011010111101000111 |
3 | 2122012201102020111010020010 |
4 | 10210223003300122331013 |
5 | 10114010013202132221 |
6 | 110435250041441303 |
7 | 4144032031621044 |
oct | 444530360327507 |
9 | 78181366433203 |
10 | 20112321130311 |
11 | 6454650a50763 |
12 | 2309a9b7a0233 |
13 | b2b778643817 |
14 | 4d76278101cb |
15 | 24d27ab25c76 |
hex | 124ac3c1af47 |
20112321130311 has 8 divisors (see below), whose sum is σ = 26842693043824. Its totient is φ = 13395081651840.
The previous prime is 20112321130303. The next prime is 20112321130339. The reversal of 20112321130311 is 11303112321102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20112321130311 - 23 = 20112321130303 is a prime.
It is a super-2 number, since 2×201123211303112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112321131311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3283105186 + ... + 3283111311.
It is an arithmetic number, because the mean of its divisors is an integer number (3355336630478).
Almost surely, 220112321130311 is an apocalyptic number.
20112321130311 is a deficient number, since it is larger than the sum of its proper divisors (6730371913513).
20112321130311 is a wasteful number, since it uses less digits than its factorization.
20112321130311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6566217521.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 20112321130311 its reverse (11303112321102), we get a palindrome (31415433451413).
The spelling of 20112321130311 in words is "twenty trillion, one hundred twelve billion, three hundred twenty-one million, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •