Base | Representation |
---|---|
bin | 110000001010100110110101… |
… | …001101000011011101011101 |
3 | 1000210001020110212212020012221 |
4 | 300022212311031003131131 |
5 | 210231201312224313112 |
6 | 2030311413414025341 |
7 | 62422403542333246 |
oct | 6012466515033535 |
9 | 1023036425766187 |
10 | 211835122104157 |
11 | 61551852996712 |
12 | 1b913095948251 |
13 | 9127c73c65b46 |
14 | 3a44c35d33ccd |
15 | 19754b7189e07 |
hex | c0a9b534375d |
211835122104157 has 2 divisors, whose sum is σ = 211835122104158. Its totient is φ = 211835122104156.
The previous prime is 211835122104119. The next prime is 211835122104161. The reversal of 211835122104157 is 751401221538112.
211835122104157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 159753699275641 + 52081422828516 = 12639371^2 + 7216746^2 .
It is a cyclic number.
It is not a de Polignac number, because 211835122104157 - 27 = 211835122104029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211835122104457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105917561052078 + 105917561052079.
It is an arithmetic number, because the mean of its divisors is an integer number (105917561052079).
Almost surely, 2211835122104157 is an apocalyptic number.
It is an amenable number.
211835122104157 is a deficient number, since it is larger than the sum of its proper divisors (1).
211835122104157 is an equidigital number, since it uses as much as digits as its factorization.
211835122104157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 134400, while the sum is 43.
The spelling of 211835122104157 in words is "two hundred eleven trillion, eight hundred thirty-five billion, one hundred twenty-two million, one hundred four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •