Base | Representation |
---|---|
bin | 1010000000111000001110… |
… | …1110000110010001000101 |
3 | 1102222120021112121020201022 |
4 | 2200032003232012101011 |
5 | 2420342403014013422 |
6 | 35230004322240525 |
7 | 2214314203005536 |
oct | 240160356062105 |
9 | 42876245536638 |
10 | 11010211079237 |
11 | 356544a133977 |
12 | 1299a294b6145 |
13 | 61b348a77686 |
14 | 2a0c7b76268d |
15 | 141602d5e342 |
hex | a0383b86445 |
11010211079237 has 2 divisors, whose sum is σ = 11010211079238. Its totient is φ = 11010211079236.
The previous prime is 11010211079039. The next prime is 11010211079249. The reversal of 11010211079237 is 73297011201011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9710540398276 + 1299670680961 = 3116174^2 + 1140031^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010211079237 - 240 = 9910699451461 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11010211079197 and 11010211079206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010211019237) 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, 5505105539618 + 5505105539619.
It is an arithmetic number, because the mean of its divisors is an integer number (5505105539619).
Almost surely, 211010211079237 is an apocalyptic number.
It is an amenable number.
11010211079237 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010211079237 is an equidigital number, since it uses as much as digits as its factorization.
11010211079237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292, while the sum is 35.
The spelling of 11010211079237 in words is "eleven trillion, ten billion, two hundred eleven million, seventy-nine thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •