Base | Representation |
---|---|
bin | 110000000001010111010110… |
… | …010010110011100011101001 |
3 | 1000200210112011200011020011012 |
4 | 300001113112102303203221 |
5 | 210140300121124201301 |
6 | 2025103541204513305 |
7 | 62325461301352211 |
oct | 6001272622634351 |
9 | 1020715150136135 |
10 | 211200022100201 |
11 | 61327476558692 |
12 | 1b82bb900ab835 |
13 | 90b00cc46c434 |
14 | 3a221c8191241 |
15 | 1963be5ad5ebb |
hex | c015d64b38e9 |
211200022100201 has 4 divisors (see below), whose sum is σ = 211526451810432. Its totient is φ = 210873592389972.
The previous prime is 211200022100191. The next prime is 211200022100257. The reversal of 211200022100201 is 102001220002112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 211200022100201 - 210 = 211200022099177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211200022100261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 163214854145 + ... + 163214855438.
It is an arithmetic number, because the mean of its divisors is an integer number (52881612952608).
Almost surely, 2211200022100201 is an apocalyptic number.
It is an amenable number.
211200022100201 is a deficient number, since it is larger than the sum of its proper divisors (326429710231).
211200022100201 is an equidigital number, since it uses as much as digits as its factorization.
211200022100201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 326429710230.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 211200022100201 its reverse (102001220002112), we get a palindrome (313201242102313).
The spelling of 211200022100201 in words is "two hundred eleven trillion, two hundred billion, twenty-two million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •