Base | Representation |
---|---|
bin | 10110111101111001111010… |
… | …110010110100100011011011 |
3 | 111020122120022022020200212102 |
4 | 112331321322302310203123 |
5 | 101214431213324311024 |
6 | 554455505330234015 |
7 | 30163545151004315 |
oct | 2675717262644333 |
9 | 436576268220772 |
10 | 101011101010139 |
11 | 2a204627191311 |
12 | b3b476542590b |
13 | 44493c9244628 |
14 | 1ad2d6b7007b5 |
15 | ba27e58c91ae |
hex | 5bde7acb48db |
101011101010139 has 2 divisors, whose sum is σ = 101011101010140. Its totient is φ = 101011101010138.
The previous prime is 101011101010093. The next prime is 101011101010199. The reversal of 101011101010139 is 931010101110101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101011101010139 - 212 = 101011101006043 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101011101010139.
It is not a weakly prime, because it can be changed into another prime (101011101010199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505550505069 + 50505550505070.
It is an arithmetic number, because the mean of its divisors is an integer number (50505550505070).
Almost surely, 2101011101010139 is an apocalyptic number.
101011101010139 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011101010139 is an equidigital number, since it uses as much as digits as its factorization.
101011101010139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 101011101010139 in words is "one hundred one trillion, eleven billion, one hundred one million, ten thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •