Base | Representation |
---|---|
bin | 1001010010000111011001… |
… | …11101100110010001010111 |
3 | 2200021112020002000221220120 |
4 | 10221003230331212101113 |
5 | 10133424134000123421 |
6 | 111225523411003023 |
7 | 4204560346254330 |
oct | 451035475462127 |
9 | 80245202027816 |
10 | 20413660161111 |
11 | 6560425a83688 |
12 | 2358379599473 |
13 | b50ccc9c4a39 |
14 | 508052713287 |
15 | 256015b348c6 |
hex | 1290ecf66457 |
20413660161111 has 64 divisors (see below), whose sum is σ = 32007666087936. Its totient is φ = 11329596518400.
The previous prime is 20413660161091. The next prime is 20413660161133. The reversal of 20413660161111 is 11116106631402.
It is not a de Polignac number, because 20413660161111 - 27 = 20413660160983 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20413660161311) 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 63 ways as a sum of consecutive naturals, for example, 731842081 + ... + 731869973.
It is an arithmetic number, because the mean of its divisors is an integer number (500119782624).
Almost surely, 220413660161111 is an apocalyptic number.
20413660161111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20413660161111 is a deficient number, since it is larger than the sum of its proper divisors (11594005926825).
20413660161111 is a wasteful number, since it uses less digits than its factorization.
20413660161111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31712.
The product of its (nonzero) digits is 5184, while the sum is 33.
Adding to 20413660161111 its reverse (11116106631402), we get a palindrome (31529766792513).
The spelling of 20413660161111 in words is "twenty trillion, four hundred thirteen billion, six hundred sixty million, one hundred sixty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •