Base | Representation |
---|---|
bin | 111110101001101… |
… | …0011001000101001 |
3 | 12102111200101111212 |
4 | 1331103103020221 |
5 | 13301131223423 |
6 | 544333402505 |
7 | 103044333242 |
oct | 17523231051 |
9 | 5374611455 |
10 | 2102211113 |
11 | 989709362 |
12 | 4a8039435 |
13 | 2766b3402 |
14 | 15d2a3cc9 |
15 | c4852578 |
hex | 7d4d3229 |
2102211113 has 4 divisors (see below), whose sum is σ = 2102315460. Its totient is φ = 2102106768.
The previous prime is 2102211107. The next prime is 2102211161. The reversal of 2102211113 is 3111122012.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 1260747049 + 841464064 = 35507^2 + 29008^2 .
It is a cyclic number.
It is not a de Polignac number, because 2102211113 - 220 = 2101162537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2102211173) 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, 11258 + ... + 65811.
It is an arithmetic number, because the mean of its divisors is an integer number (525578865).
Almost surely, 22102211113 is an apocalyptic number.
It is an amenable number.
2102211113 is a deficient number, since it is larger than the sum of its proper divisors (104347).
2102211113 is an equidigital number, since it uses as much as digits as its factorization.
2102211113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104346.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 2102211113 is about 45849.8758231688. The cubic root of 2102211113 is about 1281.0284526138.
Adding to 2102211113 its reverse (3111122012), we get a palindrome (5213333125).
The spelling of 2102211113 in words is "two billion, one hundred two million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •