Base | Representation |
---|---|
bin | 101111001101000001… |
… | …1000110000000111011 |
3 | 100200122120012001110022 |
4 | 1132122003012000323 |
5 | 3130100400001024 |
6 | 114322420041055 |
7 | 10216004105456 |
oct | 1363203060073 |
9 | 320576161408 |
10 | 101368750139 |
11 | 39a99020368 |
12 | 1779023318b |
13 | 9736269377 |
14 | 4c98b5a49d |
15 | 29844aa35e |
hex | 179a0c603b |
101368750139 has 2 divisors, whose sum is σ = 101368750140. Its totient is φ = 101368750138.
The previous prime is 101368750079. The next prime is 101368750141. The reversal of 101368750139 is 931057863101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101368750139 - 28 = 101368749883 is a prime.
It is a Sophie Germain prime.
Together with 101368750141, 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 101368750139.
It is not a weakly prime, because it can be changed into another prime (101368750939) 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, 50684375069 + 50684375070.
It is an arithmetic number, because the mean of its divisors is an integer number (50684375070).
Almost surely, 2101368750139 is an apocalyptic number.
101368750139 is a deficient number, since it is larger than the sum of its proper divisors (1).
101368750139 is an equidigital number, since it uses as much as digits as its factorization.
101368750139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136080, while the sum is 44.
The spelling of 101368750139 in words is "one hundred one billion, three hundred sixty-eight million, seven hundred fifty thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •