Base | Representation |
---|---|
bin | 10100100001101101… |
… | …00101101001011101 |
3 | 1001110000101022121021 |
4 | 22100312211221131 |
5 | 140032130214202 |
6 | 5021304204141 |
7 | 540042563035 |
oct | 122066455135 |
9 | 31400338537 |
10 | 11020163677 |
11 | 4745660096 |
12 | 2176769651 |
13 | 1068167413 |
14 | 76783c8c5 |
15 | 447723a37 |
hex | 290da5a5d |
11020163677 has 2 divisors, whose sum is σ = 11020163678. Its totient is φ = 11020163676.
The previous prime is 11020163641. The next prime is 11020163741. The reversal of 11020163677 is 77636102011.
11020163677 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6998828281 + 4021335396 = 83659^2 + 63414^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020163677 - 223 = 11011775069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020163177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510081838 + 5510081839.
It is an arithmetic number, because the mean of its divisors is an integer number (5510081839).
Almost surely, 211020163677 is an apocalyptic number.
It is an amenable number.
11020163677 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020163677 is an equidigital number, since it uses as much as digits as its factorization.
11020163677 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10584, while the sum is 34.
Adding to 11020163677 its reverse (77636102011), we get a palindrome (88656265688).
The spelling of 11020163677 in words is "eleven billion, twenty million, one hundred sixty-three thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •