Base | Representation |
---|---|
bin | 111110101001101… |
… | …0011001010001011 |
3 | 12102111200101122111 |
4 | 1331103103022023 |
5 | 13301131224321 |
6 | 544333403151 |
7 | 103044333442 |
oct | 17523231213 |
9 | 5374611574 |
10 | 2102211211 |
11 | 989709441 |
12 | 4a80394b7 |
13 | 2766b3479 |
14 | 15d2a3d59 |
15 | c48525e1 |
hex | 7d4d328b |
2102211211 has 4 divisors (see below), whose sum is σ = 2225870712. Its totient is φ = 1978551712.
The previous prime is 2102211193. The next prime is 2102211217. The reversal of 2102211211 is 1121122012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2102211211 - 25 = 2102211179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2102211191 and 2102211200.
It is not an unprimeable number, because it can be changed into a prime (2102211217) 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, 61829725 + ... + 61829758.
It is an arithmetic number, because the mean of its divisors is an integer number (556467678).
Almost surely, 22102211211 is an apocalyptic number.
2102211211 is a deficient number, since it is larger than the sum of its proper divisors (123659501).
2102211211 is a wasteful number, since it uses less digits than its factorization.
2102211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123659500.
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 2102211211 is about 45849.8768918740. The cubic root of 2102211211 is about 1281.0284725200.
Adding to 2102211211 its reverse (1121122012), we get a palindrome (3223333223).
The spelling of 2102211211 in words is "two billion, one hundred two million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •