Base | Representation |
---|---|
bin | 1010001000010101001000… |
… | …1100100000011111110101 |
3 | 1110102210201100022001120121 |
4 | 2202011102030200133311 |
5 | 2424442043134142302 |
6 | 35404455403131541 |
7 | 2226465463111015 |
oct | 242052214403765 |
9 | 43383640261517 |
10 | 11138229209077 |
11 | 3604773019683 |
12 | 12ba7b6513bb1 |
13 | 62a43b181c69 |
14 | 2a7143931c45 |
15 | 144ae6be1e37 |
hex | a21523207f5 |
11138229209077 has 2 divisors, whose sum is σ = 11138229209078. Its totient is φ = 11138229209076.
The previous prime is 11138229209059. The next prime is 11138229209101. The reversal of 11138229209077 is 77090292283111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8181236001796 + 2956993207281 = 2860286^2 + 1719591^2 .
It is an emirp because it is prime and its reverse (77090292283111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11138229209077 - 27 = 11138229208949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11138229209047) by changing a digit.
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 as a sum of consecutive naturals, namely, 5569114604538 + 5569114604539.
It is an arithmetic number, because the mean of its divisors is an integer number (5569114604539).
Almost surely, 211138229209077 is an apocalyptic number.
It is an amenable number.
11138229209077 is a deficient number, since it is larger than the sum of its proper divisors (1).
11138229209077 is an equidigital number, since it uses as much as digits as its factorization.
11138229209077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 762048, while the sum is 52.
The spelling of 11138229209077 in words is "eleven trillion, one hundred thirty-eight billion, two hundred twenty-nine million, two hundred nine thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •