Base | Representation |
---|---|
bin | 11101110101110011100… |
… | …001010001001110101101 |
3 | 21021001001110020110001022 |
4 | 131311303201101032231 |
5 | 232044201200020412 |
6 | 4210014434223525 |
7 | 301103465110244 |
oct | 35656341211655 |
9 | 7231043213038 |
10 | 2050637501357 |
11 | 720741456065 |
12 | 291516424ba5 |
13 | 11b4b3400123 |
14 | 71373b2995b |
15 | 3851d7eba72 |
hex | 1dd738513ad |
2050637501357 has 8 divisors (see below), whose sum is σ = 2081301645792. Its totient is φ = 2019975051600.
The previous prime is 2050637501351. The next prime is 2050637501369. The reversal of 2050637501357 is 7531057360502.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2050637501357 - 210 = 2050637500333 is a prime.
It is a super-2 number, since 2×20506375013572 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2050637501351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2128607 + ... + 2938067.
It is an arithmetic number, because the mean of its divisors is an integer number (260162705724).
Almost surely, 22050637501357 is an apocalyptic number.
It is an amenable number.
2050637501357 is a deficient number, since it is larger than the sum of its proper divisors (30664144435).
2050637501357 is an equidigital number, since it uses as much as digits as its factorization.
2050637501357 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 847339.
The product of its (nonzero) digits is 661500, while the sum is 44.
The spelling of 2050637501357 in words is "two trillion, fifty billion, six hundred thirty-seven million, five hundred one thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •