Base | Representation |
---|---|
bin | 1001010010010110111101… |
… | …10000000010100001001101 |
3 | 2200022022210002212002010202 |
4 | 10221023132300002201031 |
5 | 10134043234441112430 |
6 | 111233424224343245 |
7 | 4205304325654550 |
oct | 451133660024115 |
9 | 80268702762122 |
10 | 20422011660365 |
11 | 6563a211aa687 |
12 | 2359b0a474b25 |
13 | b51a30cc7583 |
14 | 508605958697 |
15 | 256353e12d45 |
hex | 1292dec0284d |
20422011660365 has 16 divisors (see below), whose sum is σ = 28042917773952. Its totient is φ = 13985871390144.
The previous prime is 20422011660307. The next prime is 20422011660371. The reversal of 20422011660365 is 56306611022402.
It is a cyclic number.
It is not a de Polignac number, because 20422011660365 - 226 = 20421944551501 is a prime.
It is a super-2 number, since 2×204220116603652 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 370675154 + ... + 370730243.
It is an arithmetic number, because the mean of its divisors is an integer number (1752682360872).
Almost surely, 220422011660365 is an apocalyptic number.
It is an amenable number.
20422011660365 is a deficient number, since it is larger than the sum of its proper divisors (7620906113587).
20422011660365 is an equidigital number, since it uses as much as digits as its factorization.
20422011660365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 741406196.
The product of its (nonzero) digits is 103680, while the sum is 38.
Adding to 20422011660365 its reverse (56306611022402), we get a palindrome (76728622682767).
The spelling of 20422011660365 in words is "twenty trillion, four hundred twenty-two billion, eleven million, six hundred sixty thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •