Base | Representation |
---|---|
bin | 111110110111001… |
… | …1101010110110101 |
3 | 12110000002002222112 |
4 | 1331232131112311 |
5 | 13304442041434 |
6 | 545150140405 |
7 | 103162005452 |
oct | 17556352665 |
9 | 5400062875 |
10 | 2109330869 |
11 | 992731558 |
12 | 4aa4b1705 |
13 | 278006c99 |
14 | 1601d8829 |
15 | c52abdce |
hex | 7db9d5b5 |
2109330869 has 2 divisors, whose sum is σ = 2109330870. Its totient is φ = 2109330868.
The previous prime is 2109330859. The next prime is 2109330871. The reversal of 2109330869 is 9680339012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1415640625 + 693690244 = 37625^2 + 26338^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2109330869 is a prime.
It is a super-2 number, since 2×21093308692 = 8898553429832590322, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 2109330871, it forms a pair of twin primes.
It is a Chen 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 (2109330859) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1054665434 + 1054665435.
It is an arithmetic number, because the mean of its divisors is an integer number (1054665435).
Almost surely, 22109330869 is an apocalyptic number.
It is an amenable number.
2109330869 is a deficient number, since it is larger than the sum of its proper divisors (1).
2109330869 is an equidigital number, since it uses as much as digits as its factorization.
2109330869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 41.
The square root of 2109330869 is about 45927.4522371969. The cubic root of 2109330869 is about 1282.4730161883.
The spelling of 2109330869 in words is "two billion, one hundred nine million, three hundred thirty thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •