Base | Representation |
---|---|
bin | 111110101001011… |
… | …1101001011111011 |
3 | 12102111111211012011 |
4 | 1331102331023323 |
5 | 13301120334321 |
6 | 544331430351 |
7 | 103043510161 |
oct | 17522751373 |
9 | 5374454164 |
10 | 2102121211 |
11 | 989657863 |
12 | 4a7bb53b7 |
13 | 276681508 |
14 | 15d27d231 |
15 | c4835ae1 |
hex | 7d4bd2fb |
2102121211 has 8 divisors (see below), whose sum is σ = 2133609984. Its totient is φ = 2070684840.
The previous prime is 2102121169. The next prime is 2102121223. The reversal of 2102121211 is 1121212012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2102121211 - 211 = 2102119163 is a prime.
It is a super-2 number, since 2×21021212112 = 8837827171472213042, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2102121191 and 2102121200.
It is not an unprimeable number, because it can be changed into a prime (2102121011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71806 + ... + 96748.
It is an arithmetic number, because the mean of its divisors is an integer number (266701248).
Almost surely, 22102121211 is an apocalyptic number.
2102121211 is a deficient number, since it is larger than the sum of its proper divisors (31488773).
2102121211 is a wasteful number, since it uses less digits than its factorization.
2102121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26201.
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 2102121211 is about 45848.8954174471. The cubic root of 2102121211 is about 1281.0101911016.
Adding to 2102121211 its reverse (1121212012), we get a palindrome (3223333223).
The spelling of 2102121211 in words is "two billion, one hundred two million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •