Base | Representation |
---|---|
bin | 101101101111111111100111… |
… | …001010100001101110101011 |
3 | 222101102111201120112111100102 |
4 | 231233333213022201232223 |
5 | 202333112003032242303 |
6 | 1551534410035500015 |
7 | 60244646415015524 |
oct | 5557774712415653 |
9 | 871374646474312 |
10 | 201210211212203 |
11 | 59125853765296 |
12 | 1a697a7875760b |
13 | 883707024588b |
14 | 37988aa37184b |
15 | 183de15459288 |
hex | b6ffe72a1bab |
201210211212203 has 2 divisors, whose sum is σ = 201210211212204. Its totient is φ = 201210211212202.
The previous prime is 201210211212133. The next prime is 201210211212217. The reversal of 201210211212203 is 302212112012102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201210211212203 is a prime.
It is a super-2 number, since 2×2012102112122032 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201210211212223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100605105606101 + 100605105606102.
It is an arithmetic number, because the mean of its divisors is an integer number (100605105606102).
Almost surely, 2201210211212203 is an apocalyptic number.
201210211212203 is a deficient number, since it is larger than the sum of its proper divisors (1).
201210211212203 is an equidigital number, since it uses as much as digits as its factorization.
201210211212203 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 20.
Adding to 201210211212203 its reverse (302212112012102), we get a palindrome (503422323224305).
The spelling of 201210211212203 in words is "two hundred one trillion, two hundred ten billion, two hundred eleven million, two hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •