Base | Representation |
---|---|
bin | 110010011001010… |
… | …1011010010011111 |
3 | 11100211221000021222 |
4 | 1210302223102133 |
5 | 11430344143421 |
6 | 435444043555 |
7 | 56622212654 |
oct | 14462532237 |
9 | 4324830258 |
10 | 1691006111 |
11 | 79858aa13 |
12 | 3b23935bb |
13 | 20c44a942 |
14 | 120823c2b |
15 | 9d6c8cab |
hex | 64cab49f |
1691006111 has 2 divisors, whose sum is σ = 1691006112. Its totient is φ = 1691006110.
The previous prime is 1691006087. The next prime is 1691006113. The reversal of 1691006111 is 1116001961.
It is a strong prime.
It is an emirp because it is prime and its reverse (1116001961) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 1119001691 and 1961009111.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1691006111 is a prime.
Together with 1691006113, 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 (1691006113) 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, 845503055 + 845503056.
It is an arithmetic number, because the mean of its divisors is an integer number (845503056).
Almost surely, 21691006111 is an apocalyptic number.
1691006111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1691006111 is an equidigital number, since it uses as much as digits as its factorization.
1691006111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 26.
The square root of 1691006111 is about 41121.8446935446. The cubic root of 1691006111 is about 1191.3747525597.
The spelling of 1691006111 in words is "one billion, six hundred ninety-one million, six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •