Base | Representation |
---|---|
bin | 101101100001011100010011… |
… | …000011100101101110110011 |
3 | 222020212220120111001021001201 |
4 | 231201130103003211232303 |
5 | 202220221012333223443 |
6 | 1545451145550112031 |
7 | 60112465616526433 |
oct | 5541342303455663 |
9 | 866786514037051 |
10 | 200210220211123 |
11 | 5887a74a926421 |
12 | 1a5560b97ab617 |
13 | 8793986aab055 |
14 | 37623251cc2c3 |
15 | 1822dd98be34d |
hex | b617130e5bb3 |
200210220211123 has 2 divisors, whose sum is σ = 200210220211124. Its totient is φ = 200210220211122.
The previous prime is 200210220211063. The next prime is 200210220211163. The reversal of 200210220211123 is 321112022012002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200210220211123 is a prime.
It is a super-2 number, since 2×2002102202111232 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200210220211123.
It is not a weakly prime, because it can be changed into another prime (200210220211163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105110105561 + 100105110105562.
It is an arithmetic number, because the mean of its divisors is an integer number (100105110105562).
Almost surely, 2200210220211123 is an apocalyptic number.
200210220211123 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210220211123 is an equidigital number, since it uses as much as digits as its factorization.
200210220211123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 200210220211123 its reverse (321112022012002), we get a palindrome (521322242223125).
The spelling of 200210220211123 in words is "two hundred trillion, two hundred ten billion, two hundred twenty million, two hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •