Base | Representation |
---|---|
bin | 10111000000101010110010… |
… | …010000100000111101111011 |
3 | 111021022201111101201010220111 |
4 | 113000222302100200331323 |
5 | 101231034132041232024 |
6 | 555123034025205151 |
7 | 30213350241442423 |
oct | 2700526220407573 |
9 | 437281441633814 |
10 | 101201010102139 |
11 | 2a27811a996a22 |
12 | b4255256307b7 |
13 | 44612a2a9700c |
14 | 1adc225557483 |
15 | ba770ced4a94 |
hex | 5c0ab2420f7b |
101201010102139 has 2 divisors, whose sum is σ = 101201010102140. Its totient is φ = 101201010102138.
The previous prime is 101201010102107. The next prime is 101201010102161. The reversal of 101201010102139 is 931201010102101.
It is an a-pointer prime, because the next prime (101201010102161) can be obtained adding 101201010102139 to its sum of digits (22).
It is a strong prime.
It is an emirp because it is prime and its reverse (931201010102101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101201010102139 - 25 = 101201010102107 is a prime.
It is a super-3 number, since 3×1012010101021393 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (101201010102239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50600505051069 + 50600505051070.
It is an arithmetic number, because the mean of its divisors is an integer number (50600505051070).
Almost surely, 2101201010102139 is an apocalyptic number.
101201010102139 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201010102139 is an equidigital number, since it uses as much as digits as its factorization.
101201010102139 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 22.
The spelling of 101201010102139 in words is "one hundred one trillion, two hundred one billion, ten million, one hundred two thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •