Base | Representation |
---|---|
bin | 111111110110101… |
… | …1100110110110111 |
3 | 12112022201102121110 |
4 | 1333231130312313 |
5 | 13342002333421 |
6 | 552335450103 |
7 | 104044656531 |
oct | 17755346667 |
9 | 5468642543 |
10 | 2142621111 |
11 | 9aa4a9a54 |
12 | 4b9686933 |
13 | 281b91757 |
14 | 1647c2851 |
15 | c8185a76 |
hex | 7fb5cdb7 |
2142621111 has 8 divisors (see below), whose sum is σ = 2857742320. Its totient is φ = 1427956992.
The previous prime is 2142621083. The next prime is 2142621139. The reversal of 2142621111 is 1111262412.
It is an interprime number because it is at equal distance from previous prime (2142621083) and next prime (2142621139).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2142621111 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 (2142621161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103180 + ... + 122193.
It is an arithmetic number, because the mean of its divisors is an integer number (357217790).
Almost surely, 22142621111 is an apocalyptic number.
2142621111 is a deficient number, since it is larger than the sum of its proper divisors (715121209).
2142621111 is a wasteful number, since it uses less digits than its factorization.
2142621111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228545.
The product of its digits is 192, while the sum is 21.
The square root of 2142621111 is about 46288.4554829819. The cubic root of 2142621111 is about 1289.1846521235.
Adding to 2142621111 its reverse (1111262412), we get a palindrome (3253883523).
The spelling of 2142621111 in words is "two billion, one hundred forty-two million, six hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •