Base | Representation |
---|---|
bin | 101111110001100001010100… |
… | …110000011111111011011101 |
3 | 1000112221102210022220102110101 |
4 | 233301201110300133323131 |
5 | 210014430240330321112 |
6 | 2022511432442341101 |
7 | 62154014645260111 |
oct | 5761412460377335 |
9 | 1015842708812411 |
10 | 210111222120157 |
11 | 60a4773a331436 |
12 | 1b694b671ba791 |
13 | 9031531b81c07 |
14 | 39c561a383741 |
15 | 194571d534757 |
hex | bf1854c1fedd |
210111222120157 has 2 divisors, whose sum is σ = 210111222120158. Its totient is φ = 210111222120156.
The previous prime is 210111222120089. The next prime is 210111222120209. The reversal of 210111222120157 is 751021222111012.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 171819952376121 + 38291269744036 = 13108011^2 + 6187994^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210111222120157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210111222120257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105055611060078 + 105055611060079.
It is an arithmetic number, because the mean of its divisors is an integer number (105055611060079).
Almost surely, 2210111222120157 is an apocalyptic number.
It is an amenable number.
210111222120157 is a deficient number, since it is larger than the sum of its proper divisors (1).
210111222120157 is an equidigital number, since it uses as much as digits as its factorization.
210111222120157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1120, while the sum is 28.
Adding to 210111222120157 its reverse (751021222111012), we get a palindrome (961132444231169).
The spelling of 210111222120157 in words is "two hundred ten trillion, one hundred eleven billion, two hundred twenty-two million, one hundred twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •