Base | Representation |
---|---|
bin | 101111110001100010001010… |
… | …010010011100101010111101 |
3 | 1000112221112002220211020002001 |
4 | 233301202022102130222331 |
5 | 210014434110233242112 |
6 | 2022512101523502301 |
7 | 62154046132031122 |
oct | 5761421222345275 |
9 | 1015845086736061 |
10 | 210112120212157 |
11 | 60a48060280229 |
12 | 1b695177b27991 |
13 | 9031645c5acb7 |
14 | 39c56a3764749 |
15 | 19457722d5c57 |
hex | bf188a49cabd |
210112120212157 has 2 divisors, whose sum is σ = 210112120212158. Its totient is φ = 210112120212156.
The previous prime is 210112120212151. The next prime is 210112120212187. The reversal of 210112120212157 is 751212021211012.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 154856595451321 + 55255524760836 = 12444139^2 + 7433406^2 .
It is a cyclic number.
It is not a de Polignac number, because 210112120212157 - 23 = 210112120212149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210112120212151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105056060106078 + 105056060106079.
It is an arithmetic number, because the mean of its divisors is an integer number (105056060106079).
Almost surely, 2210112120212157 is an apocalyptic number.
It is an amenable number.
210112120212157 is a deficient number, since it is larger than the sum of its proper divisors (1).
210112120212157 is an equidigital number, since it uses as much as digits as its factorization.
210112120212157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 28.
Adding to 210112120212157 its reverse (751212021211012), we get a palindrome (961324141423169).
The spelling of 210112120212157 in words is "two hundred ten trillion, one hundred twelve billion, one hundred twenty million, two hundred twelve thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •