Base | Representation |
---|---|
bin | 111110111010101… |
… | …0101000101110101 |
3 | 12110010110121200212 |
4 | 1331311111011311 |
5 | 13310422211041 |
6 | 545252515205 |
7 | 103213216565 |
oct | 17565250565 |
9 | 5403417625 |
10 | 2111132021 |
11 | 993751809 |
12 | 4ab01bb05 |
13 | 2784b7a5b |
14 | 160546da5 |
15 | c55158eb |
hex | 7dd55175 |
2111132021 has 2 divisors, whose sum is σ = 2111132022. Its totient is φ = 2111132020.
The previous prime is 2111132017. The next prime is 2111132033. The reversal of 2111132021 is 1202311112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1976247025 + 134884996 = 44455^2 + 11614^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111132021 - 22 = 2111132017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2111131987 and 2111132005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111132081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055566010 + 1055566011.
It is an arithmetic number, because the mean of its divisors is an integer number (1055566011).
Almost surely, 22111132021 is an apocalyptic number.
It is an amenable number.
2111132021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111132021 is an equidigital number, since it uses as much as digits as its factorization.
2111132021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 2111132021 is about 45947.0567174874. The cubic root of 2111132021 is about 1282.8379457659.
Adding to 2111132021 its reverse (1202311112), we get a palindrome (3313443133).
The spelling of 2111132021 in words is "two billion, one hundred eleven million, one hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •