Base | Representation |
---|---|
bin | 11110001110011001001… |
… | …110011000010101111101 |
3 | 21100120012110222122022200 |
4 | 132032121032120111331 |
5 | 233012234202401431 |
6 | 4230102353102113 |
7 | 303026661513540 |
oct | 36163116302575 |
9 | 7316173878280 |
10 | 2077039887741 |
11 | 73095a9607a5 |
12 | 296664557939 |
13 | 120b3033c370 |
14 | 7275a446857 |
15 | 39066685ee6 |
hex | 1e39939857d |
2077039887741 has 96 divisors (see below), whose sum is σ = 3732221525760. Its totient is φ = 1083855485952.
The previous prime is 2077039887701. The next prime is 2077039887749. The reversal of 2077039887741 is 1477889307702.
It is not a de Polignac number, because 2077039887741 - 26 = 2077039887677 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2077039887749) 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 95 ways as a sum of consecutive naturals, for example, 32843890 + ... + 32907068.
It is an arithmetic number, because the mean of its divisors is an integer number (38877307560).
Almost surely, 22077039887741 is an apocalyptic number.
2077039887741 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2077039887741 is a deficient number, since it is larger than the sum of its proper divisors (1655181638019).
2077039887741 is a wasteful number, since it uses less digits than its factorization.
2077039887741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63635 (or 63632 counting only the distinct ones).
The product of its (nonzero) digits is 33191424, while the sum is 63.
The spelling of 2077039887741 in words is "two trillion, seventy-seven billion, thirty-nine million, eight hundred eighty-seven thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •