Base | Representation |
---|---|
bin | 110000000001100000101110… |
… | …111111101101001100001001 |
3 | 1000200211111012000212202100011 |
4 | 300001200232333231030021 |
5 | 210140431241122401301 |
6 | 2025112325221311521 |
7 | 62326266114655024 |
oct | 6001405677551411 |
9 | 1020744160782304 |
10 | 211210100200201 |
11 | 61330778366353 |
12 | 1b831b232655a1 |
13 | 90b10473a320b |
14 | 3a228a28441bb |
15 | 19640d576ea51 |
hex | c0182efed309 |
211210100200201 has 4 divisors (see below), whose sum is σ = 211254819684112. Its totient is φ = 211165380716292.
The previous prime is 211210100200199. The next prime is 211210100200207. The reversal of 211210100200201 is 102002001012112.
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 211210100200201 - 21 = 211210100200199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211210100200207) 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, 22359734871 + ... + 22359744316.
It is an arithmetic number, because the mean of its divisors is an integer number (52813704921028).
Almost surely, 2211210100200201 is an apocalyptic number.
It is an amenable number.
211210100200201 is a deficient number, since it is larger than the sum of its proper divisors (44719483911).
211210100200201 is an equidigital number, since it uses as much as digits as its factorization.
211210100200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44719483910.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 211210100200201 its reverse (102002001012112), we get a palindrome (313212101212313).
The spelling of 211210100200201 in words is "two hundred eleven trillion, two hundred ten billion, one hundred million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •