Base | Representation |
---|---|
bin | 101111110011000110110101… |
… | …000000100000100010110001 |
3 | 1000120022212002221220212112002 |
4 | 233303012311000200202301 |
5 | 210023221443021041423 |
6 | 2023033455354543345 |
7 | 62164623542361206 |
oct | 5763066500404261 |
9 | 1016285087825462 |
10 | 210220211112113 |
11 | 60a8998881a204 |
12 | 1b6b2103437b55 |
13 | 903b8b0a892b7 |
14 | 39ca9d9191cad |
15 | 194849b9c4228 |
hex | bf31b50208b1 |
210220211112113 has 2 divisors, whose sum is σ = 210220211112114. Its totient is φ = 210220211112112.
The previous prime is 210220211112089. The next prime is 210220211112161. The reversal of 210220211112113 is 311211112022012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 178725027340864 + 31495183771249 = 13368808^2 + 5612057^2 .
It is a cyclic number.
It is not a de Polignac number, because 210220211112113 - 216 = 210220211046577 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (210220211112013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105110105556056 + 105110105556057.
It is an arithmetic number, because the mean of its divisors is an integer number (105110105556057).
Almost surely, 2210220211112113 is an apocalyptic number.
It is an amenable number.
210220211112113 is a deficient number, since it is larger than the sum of its proper divisors (1).
210220211112113 is an equidigital number, since it uses as much as digits as its factorization.
210220211112113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 210220211112113 its reverse (311211112022012), we get a palindrome (521431323134125).
The spelling of 210220211112113 in words is "two hundred ten trillion, two hundred twenty billion, two hundred eleven million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •