Base | Representation |
---|---|
bin | 101101100001011100010011… |
… | …000011101001011001001011 |
3 | 222020212220120111002000122021 |
4 | 231201130103003221121023 |
5 | 202220221012334213443 |
6 | 1545451145550305311 |
7 | 60112465616621242 |
oct | 5541342303513113 |
9 | 866786514060567 |
10 | 200210220226123 |
11 | 5887a74a936718 |
12 | 1a5560b97b8237 |
13 | 8793986ab4b23 |
14 | 37623251d3959 |
15 | 1822dd98c39ed |
hex | b617130e964b |
200210220226123 has 2 divisors, whose sum is σ = 200210220226124. Its totient is φ = 200210220226122.
The previous prime is 200210220226103. The next prime is 200210220226129. The reversal of 200210220226123 is 321622022012002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200210220226123 - 221 = 200210218128971 is a prime.
It is a super-2 number, since 2×2002102202261232 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (200210220226129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105110113061 + 100105110113062.
It is an arithmetic number, because the mean of its divisors is an integer number (100105110113062).
Almost surely, 2200210220226123 is an apocalyptic number.
200210220226123 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210220226123 is an equidigital number, since it uses as much as digits as its factorization.
200210220226123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 200210220226123 its reverse (321622022012002), we get a palindrome (521832242238125).
The spelling of 200210220226123 in words is "two hundred trillion, two hundred ten billion, two hundred twenty million, two hundred twenty-six thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •