Base | Representation |
---|---|
bin | 10011001100100001… |
… | …001000010110101101 |
3 | 1222012102102200101111 |
4 | 103030201020112231 |
5 | 314202420344341 |
6 | 13245115312021 |
7 | 1326522340456 |
oct | 231441102655 |
9 | 58172380344 |
10 | 20611106221 |
11 | 8817483192 |
12 | 3bb274b611 |
13 | 1c36191754 |
14 | dd752012d |
15 | 80972e681 |
hex | 4cc8485ad |
20611106221 has 8 divisors (see below), whose sum is σ = 21852366840. Its totient is φ = 19373050368.
The previous prime is 20611106209. The next prime is 20611106251. The reversal of 20611106221 is 12260111602.
It can be written as a sum of positive squares in 4 ways, for example, as 10427268996 + 10183837225 = 102114^2 + 100915^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20611106221 - 27 = 20611106093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20611106192 and 20611106201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20611106251) 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, 787936 + ... + 813673.
It is an arithmetic number, because the mean of its divisors is an integer number (2731545855).
Almost surely, 220611106221 is an apocalyptic number.
It is an amenable number.
20611106221 is a deficient number, since it is larger than the sum of its proper divisors (1241260619).
20611106221 is a wasteful number, since it uses less digits than its factorization.
20611106221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1602383.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 20611106221 its reverse (12260111602), we get a palindrome (32871217823).
The spelling of 20611106221 in words is "twenty billion, six hundred eleven million, one hundred six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •