Base | Representation |
---|---|
bin | 111110010110001… |
… | …1010110101011101 |
3 | 12101210111120121120 |
4 | 1330230122311131 |
5 | 13241024102122 |
6 | 543331121153 |
7 | 102561603603 |
oct | 17454326535 |
9 | 5353446546 |
10 | 2092019037 |
11 | 983987959 |
12 | 4a47431b9 |
13 | 2745552b4 |
14 | 15bbad873 |
15 | c39dc75c |
hex | 7cb1ad5d |
2092019037 has 4 divisors (see below), whose sum is σ = 2789358720. Its totient is φ = 1394679356.
The previous prime is 2092019029. The next prime is 2092019113. The reversal of 2092019037 is 7309102902.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2092019037 - 23 = 2092019029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2092018989 and 2092019007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2092019537) 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 in 3 ways as a sum of consecutive naturals, for example, 348669837 + ... + 348669842.
It is an arithmetic number, because the mean of its divisors is an integer number (697339680).
Almost surely, 22092019037 is an apocalyptic number.
It is an amenable number.
2092019037 is a deficient number, since it is larger than the sum of its proper divisors (697339683).
2092019037 is an equidigital number, since it uses as much as digits as its factorization.
2092019037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697339682.
The product of its (nonzero) digits is 6804, while the sum is 33.
The square root of 2092019037 is about 45738.5946111159. The cubic root of 2092019037 is about 1278.9548428353.
The spelling of 2092019037 in words is "two billion, ninety-two million, nineteen thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •