Base | Representation |
---|---|
bin | 10111001110000011101100… |
… | …011111100000010000100111 |
3 | 111101120200102202012111010111 |
4 | 113032003230133200100213 |
5 | 101341123013142030041 |
6 | 1001105442413433451 |
7 | 30340002210460606 |
oct | 2716035437402047 |
9 | 441520382174114 |
10 | 102121110111271 |
11 | 2a5a2357403109 |
12 | b55390919b887 |
13 | 44c9c96875744 |
14 | 1b3098c219a3d |
15 | bc160ee34981 |
hex | 5ce0ec7e0427 |
102121110111271 has 2 divisors, whose sum is σ = 102121110111272. Its totient is φ = 102121110111270.
The previous prime is 102121110111263. The next prime is 102121110111329. The reversal of 102121110111271 is 172111011121201.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102121110111271 - 23 = 102121110111263 is a prime.
It is a super-2 number, since 2×1021211101112712 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102121110114271) 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, 51060555055635 + 51060555055636.
It is an arithmetic number, because the mean of its divisors is an integer number (51060555055636).
Almost surely, 2102121110111271 is an apocalyptic number.
102121110111271 is a deficient number, since it is larger than the sum of its proper divisors (1).
102121110111271 is an equidigital number, since it uses as much as digits as its factorization.
102121110111271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 22.
Adding to 102121110111271 its reverse (172111011121201), we get a palindrome (274232121232472).
The spelling of 102121110111271 in words is "one hundred two trillion, one hundred twenty-one billion, one hundred ten million, one hundred eleven thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •