Base | Representation |
---|---|
bin | 1001001001010100011100… |
… | …01010100011101011010001 |
3 | 2122012122002120122011221010 |
4 | 10210222032022203223101 |
5 | 10114001143013341423 |
6 | 110435020522321133 |
7 | 4144000533344145 |
oct | 444521612435321 |
9 | 78178076564833 |
10 | 20111422012113 |
11 | 645422a470973 |
12 | 230988a6591a9 |
13 | b2b664298613 |
14 | 4d7580243225 |
15 | 24d226c20693 |
hex | 124a8e2a3ad1 |
20111422012113 has 8 divisors (see below), whose sum is σ = 26859406006528. Its totient is φ = 13385526346224.
The previous prime is 20111422012103. The next prime is 20111422012117. The reversal of 20111422012113 is 31121022411102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20111422012113 - 221 = 20111419914961 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20111422012113.
It is not an unprimeable number, because it can be changed into a prime (20111422012117) 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, 5522080006 + ... + 5522083647.
It is an arithmetic number, because the mean of its divisors is an integer number (3357425750816).
Almost surely, 220111422012113 is an apocalyptic number.
It is an amenable number.
20111422012113 is a deficient number, since it is larger than the sum of its proper divisors (6747983994415).
20111422012113 is a wasteful number, since it uses less digits than its factorization.
20111422012113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11044164263.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 20111422012113 its reverse (31121022411102), we get a palindrome (51232444423215).
The spelling of 20111422012113 in words is "twenty trillion, one hundred eleven billion, four hundred twenty-two million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •