Base | Representation |
---|---|
bin | 111110111001010… |
… | …1010110000100101 |
3 | 12110002011011122212 |
4 | 1331302222300211 |
5 | 13310232344331 |
6 | 545225533205 |
7 | 103204252541 |
oct | 17562526045 |
9 | 5402134585 |
10 | 2110434341 |
11 | 993315614 |
12 | 4aa944205 |
13 | 278302322 |
14 | 160404a21 |
15 | c5428d2b |
hex | 7dcaac25 |
2110434341 has 2 divisors, whose sum is σ = 2110434342. Its totient is φ = 2110434340.
The previous prime is 2110434331. The next prime is 2110434343. The reversal of 2110434341 is 1434340112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1757370241 + 353064100 = 41921^2 + 18790^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2110434341 is a prime.
Together with 2110434343, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2110434343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055217170 + 1055217171.
It is an arithmetic number, because the mean of its divisors is an integer number (1055217171).
Almost surely, 22110434341 is an apocalyptic number.
It is an amenable number.
2110434341 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110434341 is an equidigital number, since it uses as much as digits as its factorization.
2110434341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 2110434341 is about 45939.4638736675. The cubic root of 2110434341 is about 1282.6966141674.
Adding to 2110434341 its reverse (1434340112), we get a palindrome (3544774453).
The spelling of 2110434341 in words is "two billion, one hundred ten million, four hundred thirty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •