Base | Representation |
---|---|
bin | 111101000110001… |
… | …1100001101110101 |
3 | 12021212120221100010 |
4 | 1322030130031311 |
5 | 13144310103103 |
6 | 535232210433 |
7 | 101542256304 |
oct | 17214341565 |
9 | 5255527303 |
10 | 2050081653 |
11 | 962243764 |
12 | 492699a19 |
13 | 268960989 |
14 | 1563b443b |
15 | beea6903 |
hex | 7a31c375 |
2050081653 has 4 divisors (see below), whose sum is σ = 2733442208. Its totient is φ = 1366721100.
The previous prime is 2050081643. The next prime is 2050081661. The reversal of 2050081653 is 3561800502.
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 not a de Polignac number, because 2050081653 - 24 = 2050081637 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2050081653.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2050081633) 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 in 3 ways as a sum of consecutive naturals, for example, 341680273 + ... + 341680278.
It is an arithmetic number, because the mean of its divisors is an integer number (683360552).
Almost surely, 22050081653 is an apocalyptic number.
It is an amenable number.
2050081653 is a deficient number, since it is larger than the sum of its proper divisors (683360555).
2050081653 is an equidigital number, since it uses as much as digits as its factorization.
2050081653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683360554.
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 2050081653 is about 45277.8273882482. The cubic root of 2050081653 is about 1270.3509586607.
The spelling of 2050081653 in words is "two billion, fifty million, eighty-one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •