Base | Representation |
---|---|
bin | 1010011111101100000101… |
… | …1011111001010000001011 |
3 | 1111212011112111210000200112 |
4 | 2213323001123321100023 |
5 | 3003030423013102024 |
6 | 40313104041424535 |
7 | 2300463151056362 |
oct | 247730133712013 |
9 | 44764474700615 |
10 | 11539527472139 |
11 | 3749982472257 |
12 | 136453049b14b |
13 | 65923276a7a4 |
14 | 2bc7322c27d9 |
15 | 15028258600e |
hex | a7ec16f940b |
11539527472139 has 2 divisors, whose sum is σ = 11539527472140. Its totient is φ = 11539527472138.
The previous prime is 11539527472103. The next prime is 11539527472177. The reversal of 11539527472139 is 93127472593511.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11539527472139 - 28 = 11539527471883 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11539527472199) 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, 5769763736069 + 5769763736070.
It is an arithmetic number, because the mean of its divisors is an integer number (5769763736070).
Almost surely, 211539527472139 is an apocalyptic number.
11539527472139 is a deficient number, since it is larger than the sum of its proper divisors (1).
11539527472139 is an equidigital number, since it uses as much as digits as its factorization.
11539527472139 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14288400, while the sum is 59.
The spelling of 11539527472139 in words is "eleven trillion, five hundred thirty-nine billion, five hundred twenty-seven million, four hundred seventy-two thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •