Base | Representation |
---|---|
bin | 100000000001000110101… |
… | …111100010000111110001 |
3 | 21210100010102111210120012 |
4 | 200001012233202013301 |
5 | 242022012242334301 |
6 | 4402432414424305 |
7 | 314650154312231 |
oct | 40010657420761 |
9 | 7710112453505 |
10 | 2200210121201 |
11 | 779116288174 |
12 | 2b64b9b02095 |
13 | 12c62c272601 |
14 | 786c2829cc1 |
15 | 3c374b09ebb |
hex | 20046be21f1 |
2200210121201 has 4 divisors (see below), whose sum is σ = 2200339844592. Its totient is φ = 2200080397812.
The previous prime is 2200210121173. The next prime is 2200210121203. The reversal of 2200210121201 is 1021210120022.
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 2200210121201 - 238 = 1925332214257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2200210121203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64836251 + ... + 64870176.
It is an arithmetic number, because the mean of its divisors is an integer number (550084961148).
Almost surely, 22200210121201 is an apocalyptic number.
It is an amenable number.
2200210121201 is a deficient number, since it is larger than the sum of its proper divisors (129723391).
2200210121201 is a wasteful number, since it uses less digits than its factorization.
2200210121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129723390.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2200210121201 its reverse (1021210120022), we get a palindrome (3221420241223).
The spelling of 2200210121201 in words is "two trillion, two hundred billion, two hundred ten million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •