Base | Representation |
---|---|
bin | 10111001111010110100000… |
… | …000011111001111010010111 |
3 | 111101220011221011211120022222 |
4 | 113033112200003321322113 |
5 | 101344102111130333421 |
6 | 1001214345210412555 |
7 | 30346300426211312 |
oct | 2717264003717227 |
9 | 441804834746288 |
10 | 102210022121111 |
11 | 2a627032972083 |
12 | b568ba173115b |
13 | 4505496160658 |
14 | 1b34dc4823979 |
15 | bc3ab59edcab |
hex | 5cf5a00f9e97 |
102210022121111 has 2 divisors, whose sum is σ = 102210022121112. Its totient is φ = 102210022121110.
The previous prime is 102210022121059. The next prime is 102210022121143. The reversal of 102210022121111 is 111121220012201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102210022121111 is a prime.
It is a super-3 number, since 3×1022100221211113 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102210022121111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102210022121161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51105011060555 + 51105011060556.
It is an arithmetic number, because the mean of its divisors is an integer number (51105011060556).
Almost surely, 2102210022121111 is an apocalyptic number.
102210022121111 is a deficient number, since it is larger than the sum of its proper divisors (1).
102210022121111 is an equidigital number, since it uses as much as digits as its factorization.
102210022121111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 102210022121111 its reverse (111121220012201), we get a palindrome (213331242133312).
The spelling of 102210022121111 in words is "one hundred two trillion, two hundred ten billion, twenty-two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •