Base | Representation |
---|---|
bin | 1010000011001101000010… |
… | …0010001101001101010111 |
3 | 1110010101101021012221020211 |
4 | 2200303100202031031113 |
5 | 2422021204023410424 |
6 | 35300212040510251 |
7 | 2220230062414102 |
oct | 240632042151527 |
9 | 43111337187224 |
10 | 11050154513239 |
11 | 3580387167056 |
12 | 12a571647b387 |
13 | 6220431b301a |
14 | 2a2b8a607739 |
15 | 14268e8c0b94 |
hex | a0cd088d357 |
11050154513239 has 2 divisors, whose sum is σ = 11050154513240. Its totient is φ = 11050154513238.
The previous prime is 11050154513213. The next prime is 11050154513297. The reversal of 11050154513239 is 93231545105011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11050154513239 is a prime.
It is a super-2 number, since 2×110501545132392 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11050154516239) 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, 5525077256619 + 5525077256620.
It is an arithmetic number, because the mean of its divisors is an integer number (5525077256620).
Almost surely, 211050154513239 is an apocalyptic number.
11050154513239 is a deficient number, since it is larger than the sum of its proper divisors (1).
11050154513239 is an equidigital number, since it uses as much as digits as its factorization.
11050154513239 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81000, while the sum is 40.
The spelling of 11050154513239 in words is "eleven trillion, fifty billion, one hundred fifty-four million, five hundred thirteen thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •