Base | Representation |
---|---|
bin | 1010001100000011011100… |
… | …1001011110011111110001 |
3 | 1110122220211120111211212011 |
4 | 2203000313021132133301 |
5 | 2432014101141022212 |
6 | 35454115234002521 |
7 | 2234221646253661 |
oct | 243006711363761 |
9 | 43586746454764 |
10 | 11202199939057 |
11 | 362990a908966 |
12 | 130b08a116441 |
13 | 633494452bca |
14 | 2aa2918ba1a1 |
15 | 1465dcd374a7 |
hex | a303725e7f1 |
11202199939057 has 2 divisors, whose sum is σ = 11202199939058. Its totient is φ = 11202199939056.
The previous prime is 11202199939033. The next prime is 11202199939111. The reversal of 11202199939057 is 75093999120211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8948091064896 + 2254108874161 = 2991336^2 + 1501369^2 .
It is a cyclic number.
It is not a de Polignac number, because 11202199939057 - 211 = 11202199937009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11202199938992 and 11202199939010.
It is not a weakly prime, because it can be changed into another prime (11202139939057) 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 as a sum of consecutive naturals, namely, 5601099969528 + 5601099969529.
It is an arithmetic number, because the mean of its divisors is an integer number (5601099969529).
Almost surely, 211202199939057 is an apocalyptic number.
It is an amenable number.
11202199939057 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202199939057 is an equidigital number, since it uses as much as digits as its factorization.
11202199939057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2755620, while the sum is 58.
The spelling of 11202199939057 in words is "eleven trillion, two hundred two billion, one hundred ninety-nine million, nine hundred thirty-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •