Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …011101000110000101010111 |
3 | 222020212220112210001120200021 |
4 | 231201130102131012011113 |
5 | 202220221002242320043 |
6 | 1545451144545530011 |
7 | 60112465435000345 |
oct | 5541342235060527 |
9 | 866786483046607 |
10 | 200210210120023 |
11 | 5887a745163874 |
12 | 1a5560b6343907 |
13 | 8793984986b9c |
14 | 3762323b22995 |
15 | 1822dd8a793ed |
hex | b61712746157 |
200210210120023 has 2 divisors, whose sum is σ = 200210210120024. Its totient is φ = 200210210120022.
The previous prime is 200210210119939. The next prime is 200210210120029. The reversal of 200210210120023 is 320021012012002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200210210120023 - 213 = 200210210111831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200210210119979 and 200210210120006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210210120029) 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, 100105105060011 + 100105105060012.
It is an arithmetic number, because the mean of its divisors is an integer number (100105105060012).
Almost surely, 2200210210120023 is an apocalyptic number.
200210210120023 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210210120023 is an equidigital number, since it uses as much as digits as its factorization.
200210210120023 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 16.
Adding to 200210210120023 its reverse (320021012012002), we get a palindrome (520231222132025).
The spelling of 200210210120023 in words is "two hundred trillion, two hundred ten billion, two hundred ten million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •