Base | Representation |
---|---|
bin | 1010000000111011011101… |
… | …0110101111001101110011 |
3 | 1102222122111220200102020202 |
4 | 2200032313112233031303 |
5 | 2420401141301330424 |
6 | 35230230310025415 |
7 | 2214344522241665 |
oct | 240166726571563 |
9 | 42878456612222 |
10 | 11011077370739 |
11 | 3565854132566 |
12 | 129a02b64826b |
13 | 61b45639b0b4 |
14 | 2a0d20826535 |
15 | 141653e2d2ae |
hex | a03b75af373 |
11011077370739 has 2 divisors, whose sum is σ = 11011077370740. Its totient is φ = 11011077370738.
The previous prime is 11011077370693. The next prime is 11011077370751. The reversal of 11011077370739 is 93707377011011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11011077370739 - 28 = 11011077370483 is a prime.
It is a super-2 number, since 2×110110773707392 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11011077370693 and 11011077370702.
It is not a weakly prime, because it can be changed into another prime (11011077370759) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505538685369 + 5505538685370.
It is an arithmetic number, because the mean of its divisors is an integer number (5505538685370).
Almost surely, 211011077370739 is an apocalyptic number.
11011077370739 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011077370739 is an equidigital number, since it uses as much as digits as its factorization.
11011077370739 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 194481, while the sum is 47.
The spelling of 11011077370739 in words is "eleven trillion, eleven billion, seventy-seven million, three hundred seventy thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •