Base | Representation |
---|---|
bin | 111110101001101… |
… | …0000011100111001 |
3 | 12102111122211102202 |
4 | 1331103100130321 |
5 | 13301130400441 |
6 | 544333235545 |
7 | 103044256220 |
oct | 17523203471 |
9 | 5374584382 |
10 | 2102200121 |
11 | 98970107a |
12 | 4a8032bb5 |
13 | 2766ab3c8 |
14 | 15d29dcb7 |
15 | c484e19b |
hex | 7d4d0739 |
2102200121 has 4 divisors (see below), whose sum is σ = 2402514432. Its totient is φ = 1801885812.
The previous prime is 2102200081. The next prime is 2102200141. The reversal of 2102200121 is 1210022012.
It is a happy number.
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 2102200121 - 210 = 2102199097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2102200141) 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, 150157145 + ... + 150157158.
It is an arithmetic number, because the mean of its divisors is an integer number (600628608).
Almost surely, 22102200121 is an apocalyptic number.
It is an amenable number.
2102200121 is a deficient number, since it is larger than the sum of its proper divisors (300314311).
2102200121 is an equidigital number, since it uses as much as digits as its factorization.
2102200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300314310.
The product of its (nonzero) digits is 16, while the sum is 11.
The square root of 2102200121 is about 45849.7559535490. The cubic root of 2102200121 is about 1281.0262198712.
Adding to 2102200121 its reverse (1210022012), we get a palindrome (3312222133).
The spelling of 2102200121 in words is "two billion, one hundred two million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •