Base | Representation |
---|---|
bin | 11101000110101010100… |
… | …11100111101110100011 |
3 | 10112121012111022112010102 |
4 | 32203111103213232203 |
5 | 112341010320300024 |
6 | 2043222044253015 |
7 | 132151131061466 |
oct | 16432523475643 |
9 | 3477174275112 |
10 | 1000011103139 |
11 | 356114219944 |
12 | 14198584116b |
13 | 733ba685549 |
14 | 36587ad72dd |
15 | 1b02c70b1ae |
hex | e8d54e7ba3 |
1000011103139 has 2 divisors, whose sum is σ = 1000011103140. Its totient is φ = 1000011103138.
The previous prime is 1000011103097. The next prime is 1000011103141. The reversal of 1000011103139 is 9313011100001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000011103139 is a prime.
Together with 1000011103141, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1000011103139.
It is not a weakly prime, because it can be changed into another prime (1000011103159) 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, 500005551569 + 500005551570.
It is an arithmetic number, because the mean of its divisors is an integer number (500005551570).
Almost surely, 21000011103139 is an apocalyptic number.
1000011103139 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000011103139 is an equidigital number, since it uses as much as digits as its factorization.
1000011103139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 20.
The spelling of 1000011103139 in words is "one trillion, eleven million, one hundred three thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •