Base | Representation |
---|---|
bin | 111110111000110… |
… | …0001011011011101 |
3 | 12110001120220122102 |
4 | 1331301201123131 |
5 | 13310143241411 |
6 | 545215254445 |
7 | 103201562054 |
oct | 17561413335 |
9 | 5401526572 |
10 | 2110133981 |
11 | 99312a98a |
12 | 4aa81a425 |
13 | 2782286b7 |
14 | 16036739b |
15 | c53b9d3b |
hex | 7dc616dd |
2110133981 has 2 divisors, whose sum is σ = 2110133982. Its totient is φ = 2110133980.
The previous prime is 2110133957. The next prime is 2110133999. The reversal of 2110133981 is 1893310112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1312975225 + 797158756 = 36235^2 + 28234^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110133981 - 222 = 2105939677 is a prime.
It is a super-2 number, since 2×21101339812 = 8905330835541816722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2110135981) 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, 1055066990 + 1055066991.
It is an arithmetic number, because the mean of its divisors is an integer number (1055066991).
Almost surely, 22110133981 is an apocalyptic number.
It is an amenable number.
2110133981 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110133981 is an equidigital number, since it uses as much as digits as its factorization.
2110133981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 29.
The square root of 2110133981 is about 45936.1946726108. The cubic root of 2110133981 is about 1282.6357595483.
The spelling of 2110133981 in words is "two billion, one hundred ten million, one hundred thirty-three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.236 sec. • engine limits •