Base | Representation |
---|---|
bin | 100111101111011001000… |
… | …001001000110100000101 |
3 | 100200002001021011121222220 |
4 | 213233121001020310011 |
5 | 324220433431441302 |
6 | 5450325013042553 |
7 | 401206240036632 |
oct | 47573101106405 |
9 | 10602037147886 |
10 | 2730945187077 |
11 | 9632073a9558 |
12 | 381338026459 |
13 | 16a6b0b515a3 |
14 | 9626d95d189 |
15 | 4b088b644bc |
hex | 27bd9048d05 |
2730945187077 has 16 divisors (see below), whose sum is σ = 3730748017920. Its totient is φ = 1775902348800.
The previous prime is 2730945187031. The next prime is 2730945187111. The reversal of 2730945187077 is 7707815490372.
It is not a de Polignac number, because 2730945187077 - 211 = 2730945185029 is a prime.
It is a super-2 number, since 2×27309451870772 (a number of 26 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 2730945187077.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2730945187177) 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 15 ways as a sum of consecutive naturals, for example, 1331677 + ... + 2689842.
It is an arithmetic number, because the mean of its divisors is an integer number (233171751120).
Almost surely, 22730945187077 is an apocalyptic number.
It is an amenable number.
2730945187077 is a deficient number, since it is larger than the sum of its proper divisors (999802830843).
2730945187077 is a wasteful number, since it uses less digits than its factorization.
2730945187077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4027084.
The product of its (nonzero) digits is 20744640, while the sum is 60.
The spelling of 2730945187077 in words is "two trillion, seven hundred thirty billion, nine hundred forty-five million, one hundred eighty-seven thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •