Base | Representation |
---|---|
bin | 11110101110101001101… |
… | …101100011001011011001 |
3 | 21110212121100101020220222 |
4 | 132232221231203023121 |
5 | 234044203103414114 |
6 | 4254031330125425 |
7 | 305364206550332 |
oct | 36565155431331 |
9 | 7425540336828 |
10 | 2111676232409 |
11 | 744614200137 |
12 | 2a1310120875 |
13 | 124190108573 |
14 | 742c452d289 |
15 | 39de233198e |
hex | 1eba9b632d9 |
2111676232409 has 2 divisors, whose sum is σ = 2111676232410. Its totient is φ = 2111676232408.
The previous prime is 2111676232381. The next prime is 2111676232411. The reversal of 2111676232409 is 9042326761112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1564450608400 + 547225624009 = 1250780^2 + 739747^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111676232409 - 212 = 2111676228313 is a prime.
It is a Sophie Germain prime.
Together with 2111676232411, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2111676232409.
It is not a weakly prime, because it can be changed into another prime (2111676232109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055838116204 + 1055838116205.
It is an arithmetic number, because the mean of its divisors is an integer number (1055838116205).
Almost surely, 22111676232409 is an apocalyptic number.
It is an amenable number.
2111676232409 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111676232409 is an equidigital number, since it uses as much as digits as its factorization.
2111676232409 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 217728, while the sum is 44.
The spelling of 2111676232409 in words is "two trillion, one hundred eleven billion, six hundred seventy-six million, two hundred thirty-two thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •