Base | Representation |
---|---|
bin | 10111001111010111100110… |
… | …111111010100010111100101 |
3 | 111101220022000002222210222122 |
4 | 113033113212333110113211 |
5 | 101344112030244213333 |
6 | 1001215103240035325 |
7 | 30346342055654564 |
oct | 2717274677242745 |
9 | 441808002883878 |
10 | 102211212101093 |
11 | 2a627593654707 |
12 | b569274162b45 |
13 | 4505625857114 |
14 | 1b350988a5bdb |
15 | bc3b3520a798 |
hex | 5cf5e6fd45e5 |
102211212101093 has 2 divisors, whose sum is σ = 102211212101094. Its totient is φ = 102211212101092.
The previous prime is 102211212101059. The next prime is 102211212101111. The reversal of 102211212101093 is 390101212112201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86714219330209 + 15496992770884 = 9312047^2 + 3936622^2 .
It is a cyclic number.
It is not a de Polignac number, because 102211212101093 - 212 = 102211212096997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102211218101093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51105606050546 + 51105606050547.
It is an arithmetic number, because the mean of its divisors is an integer number (51105606050547).
Almost surely, 2102211212101093 is an apocalyptic number.
It is an amenable number.
102211212101093 is a deficient number, since it is larger than the sum of its proper divisors (1).
102211212101093 is an equidigital number, since it uses as much as digits as its factorization.
102211212101093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 26.
Adding to 102211212101093 its reverse (390101212112201), we get a palindrome (492312424213294).
The spelling of 102211212101093 in words is "one hundred two trillion, two hundred eleven billion, two hundred twelve million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •