Base | Representation |
---|---|
bin | 10111000000101010110010… |
… | …011000001011011010100011 |
3 | 111021022201111112111012120011 |
4 | 113000222302120023122203 |
5 | 101231034133100023021 |
6 | 555123034140225351 |
7 | 30213350264510251 |
oct | 2700526230133243 |
9 | 437281445435504 |
10 | 101201012111011 |
11 | 2a27812103924a |
12 | b42552623b257 |
13 | 44612a331b4b7 |
14 | 1adc22591b5d1 |
15 | ba770d27ede1 |
hex | 5c0ab260b6a3 |
101201012111011 has 2 divisors, whose sum is σ = 101201012111012. Its totient is φ = 101201012111010.
The previous prime is 101201012110973. The next prime is 101201012111027. The reversal of 101201012111011 is 110111210102101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101201012111011 - 217 = 101201011979939 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101201012110982 and 101201012111000.
It is not a weakly prime, because it can be changed into another prime (101201012111051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50600506055505 + 50600506055506.
It is an arithmetic number, because the mean of its divisors is an integer number (50600506055506).
Almost surely, 2101201012111011 is an apocalyptic number.
101201012111011 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201012111011 is an equidigital number, since it uses as much as digits as its factorization.
101201012111011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 101201012111011 its reverse (110111210102101), we get a palindrome (211312222213112).
The spelling of 101201012111011 in words is "one hundred one trillion, two hundred one billion, twelve million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •