Base | Representation |
---|---|
bin | 11101000110101010010… |
… | …101100101011011111001 |
3 | 21002012101122220220001210 |
4 | 131012222111211123321 |
5 | 230232013444441341 |
6 | 4130443445433333 |
7 | 264332204625042 |
oct | 35065225453371 |
9 | 7065348826053 |
10 | 2000017577721 |
11 | 701225867229 |
12 | 283749a0b849 |
13 | 1167a70aa0a7 |
14 | 6cb30d478c9 |
15 | 37059800c16 |
hex | 1d1aa5656f9 |
2000017577721 has 12 divisors (see below), whose sum is σ = 2700872985552. Its totient is φ = 1316467254024.
The previous prime is 2000017577711. The next prime is 2000017577729. The reversal of 2000017577721 is 1277757100002.
It is a de Polignac number, because none of the positive numbers 2k-2000017577721 is a prime.
It is a super-2 number, since 2×20000175777212 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2000017577721.
It is not an unprimeable number, because it can be changed into a prime (2000017577729) 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 11 ways as a sum of consecutive naturals, for example, 53391991 + ... + 53429436.
It is an arithmetic number, because the mean of its divisors is an integer number (225072748796).
Almost surely, 22000017577721 is an apocalyptic number.
It is an amenable number.
2000017577721 is a deficient number, since it is larger than the sum of its proper divisors (700855407831).
2000017577721 is an equidigital number, since it uses as much as digits as its factorization.
2000017577721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106821588 (or 106821509 counting only the distinct ones).
The product of its (nonzero) digits is 48020, while the sum is 39.
The spelling of 2000017577721 in words is "two trillion, seventeen million, five hundred seventy-seven thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •