Base | Representation |
---|---|
bin | 101101100001011101111110… |
… | …011001100001001111100111 |
3 | 222020220002012222210000101102 |
4 | 231201131332121201033213 |
5 | 202220233204401401043 |
6 | 1545452044401550315 |
7 | 60112561345156511 |
oct | 5541357631411747 |
9 | 866802188700342 |
10 | 200212021122023 |
11 | 58880494452439 |
12 | 1a55652094539b |
13 | 8793bb2c298c1 |
14 | 3762456460bb1 |
15 | 1822e92a576b8 |
hex | b6177e6613e7 |
200212021122023 has 2 divisors, whose sum is σ = 200212021122024. Its totient is φ = 200212021122022.
The previous prime is 200212021121971. The next prime is 200212021122067. The reversal of 200212021122023 is 320221120212002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200212021122023 - 222 = 200212016927719 is a prime.
It is a super-2 number, since 2×2002120211220232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200212021121986 and 200212021122004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200212021124023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100106010561011 + 100106010561012.
It is an arithmetic number, because the mean of its divisors is an integer number (100106010561012).
Almost surely, 2200212021122023 is an apocalyptic number.
200212021122023 is a deficient number, since it is larger than the sum of its proper divisors (1).
200212021122023 is an equidigital number, since it uses as much as digits as its factorization.
200212021122023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 200212021122023 its reverse (320221120212002), we get a palindrome (520433141334025).
The spelling of 200212021122023 in words is "two hundred trillion, two hundred twelve billion, twenty-one million, one hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •