Base | Representation |
---|---|
bin | 111110110110101… |
… | …0100001001110111 |
3 | 12102222111212200102 |
4 | 1331231110021313 |
5 | 13304402443111 |
6 | 545135504315 |
7 | 103156316342 |
oct | 17555241167 |
9 | 5388455612 |
10 | 2109031031 |
11 | 992547258 |
12 | 4aa38809b |
13 | 277c30673 |
14 | 16015b459 |
15 | c524d13b |
hex | 7db54277 |
2109031031 has 2 divisors, whose sum is σ = 2109031032. Its totient is φ = 2109031030.
The previous prime is 2109031013. The next prime is 2109031039. The reversal of 2109031031 is 1301309012.
Together with previous prime (2109031013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2109031031 is a prime.
It is a super-2 number, since 2×21090310312 = 8896023779441845922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2109030994 and 2109031012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2109031039) 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, 1054515515 + 1054515516.
It is an arithmetic number, because the mean of its divisors is an integer number (1054515516).
Almost surely, 22109031031 is an apocalyptic number.
2109031031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2109031031 is an equidigital number, since it uses as much as digits as its factorization.
2109031031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 20.
The square root of 2109031031 is about 45924.1878643488. The cubic root of 2109031031 is about 1282.4122461480.
The spelling of 2109031031 in words is "two billion, one hundred nine million, thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •