Base | Representation |
---|---|
bin | 1001001001010101100011… |
… | …11000010101000001111111 |
3 | 2122012200122100010202110002 |
4 | 10210222301320111001333 |
5 | 10114003404412311221 |
6 | 110435200205304515 |
7 | 4144021430435336 |
oct | 444526170250177 |
9 | 78180570122402 |
10 | 20112021213311 |
11 | 6454507723675 |
12 | 2309a1726513b |
13 | b2b72b474741 |
14 | 4d75d9a5cd1d |
15 | 24d25e63180b |
hex | 124ab1e1507f |
20112021213311 has 4 divisors (see below), whose sum is σ = 20112062253624. Its totient is φ = 20111980173000.
The previous prime is 20112021213299. The next prime is 20112021213329. The reversal of 20112021213311 is 11331212021102.
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 20112021213311 - 238 = 19837143306367 is a prime.
It is a super-3 number, since 3×201120212133113 (a number of 41 digits) contains 333 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 (20112021413311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19776080 + ... + 20768181.
It is an arithmetic number, because the mean of its divisors is an integer number (5028015563406).
Almost surely, 220112021213311 is an apocalyptic number.
20112021213311 is a deficient number, since it is larger than the sum of its proper divisors (41040313).
20112021213311 is an equidigital number, since it uses as much as digits as its factorization.
20112021213311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41040312.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 20112021213311 its reverse (11331212021102), we get a palindrome (31443233234413).
The spelling of 20112021213311 in words is "twenty trillion, one hundred twelve billion, twenty-one million, two hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •