Base | Representation |
---|---|
bin | 111011111011110… |
… | …1111101110111101 |
3 | 12012011020120111111 |
4 | 1313313233232331 |
5 | 13104320232031 |
6 | 531320522021 |
7 | 100560041356 |
oct | 16767575675 |
9 | 5164216444 |
10 | 2011102141 |
11 | 94223a894 |
12 | 481620311 |
13 | 260863789 |
14 | 151148d2d |
15 | bb8571b1 |
hex | 77defbbd |
2011102141 has 4 divisors (see below), whose sum is σ = 2011770432. Its totient is φ = 2010433852.
The previous prime is 2011102133. The next prime is 2011102151. The reversal of 2011102141 is 1412011102.
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 2011102141 - 23 = 2011102133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011102151) 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, 329611 + ... + 335656.
It is an arithmetic number, because the mean of its divisors is an integer number (502942608).
Almost surely, 22011102141 is an apocalyptic number.
It is an amenable number.
2011102141 is a deficient number, since it is larger than the sum of its proper divisors (668291).
2011102141 is an equidigital number, since it uses as much as digits as its factorization.
2011102141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668290.
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 2011102141 is about 44845.3134786680. The cubic root of 2011102141 is about 1262.2480529298.
Adding to 2011102141 its reverse (1412011102), we get a palindrome (3423113243).
It can be divided in two parts, 2011102 and 141, that multiplied together give a palindrome (283565382).
The spelling of 2011102141 in words is "two billion, eleven million, one hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •