Base | Representation |
---|---|
bin | 10111001111011111110100… |
… | …000110111000001011111011 |
3 | 111101221010202002121012121001 |
4 | 113033133310012320023323 |
5 | 101344233101130334321 |
6 | 1001223121353225431 |
7 | 30350103303623461 |
oct | 2717376406701373 |
9 | 441833662535531 |
10 | 102220022121211 |
11 | 2a6302a4687175 |
12 | b56ab12702277 |
13 | 45063cab4ab87 |
14 | 1b35692986831 |
15 | bc3e9d8abc91 |
hex | 5cf7f41b82fb |
102220022121211 has 2 divisors, whose sum is σ = 102220022121212. Its totient is φ = 102220022121210.
The previous prime is 102220022121199. The next prime is 102220022121233. The reversal of 102220022121211 is 112121220022201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102220022121211 - 213 = 102220022113019 is a prime.
It is a super-3 number, since 3×1022200221212113 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (102220022121311) 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, 51110011060605 + 51110011060606.
It is an arithmetic number, because the mean of its divisors is an integer number (51110011060606).
Almost surely, 2102220022121211 is an apocalyptic number.
102220022121211 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220022121211 is an equidigital number, since it uses as much as digits as its factorization.
102220022121211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 102220022121211 its reverse (112121220022201), we get a palindrome (214341242143412).
The spelling of 102220022121211 in words is "one hundred two trillion, two hundred twenty billion, twenty-two million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •