Base | Representation |
---|---|
bin | 100011110110110001… |
… | …1101100001001001101 |
3 | 21100202021002021202201 |
4 | 1013231203230021031 |
5 | 2230144000000302 |
6 | 55212345121501 |
7 | 5364063126100 |
oct | 1075543541115 |
9 | 240667067681 |
10 | 77000000077 |
11 | 2a723546800 |
12 | 12b0b189291 |
13 | 7351750630 |
14 | 3a26572737 |
15 | 2009e29c87 |
hex | 11ed8ec24d |
77000000077 has 72 divisors (see below), whose sum is σ = 111610514400. Its totient is φ = 52468637760.
The previous prime is 77000000059. The next prime is 77000000081.
77000000077 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-77000000077 is a prime.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 76999999991 and 77000000054.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (77000000027) 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 71 ways as a sum of consecutive naturals, for example, 1438174 + ... + 1490752.
Almost surely, 277000000077 is an apocalyptic number.
77000000077 is a gapful number since it is divisible by the number (77) formed by its first and last digit.
It is an amenable number.
77000000077 is a deficient number, since it is larger than the sum of its proper divisors (34610514323).
77000000077 is a wasteful number, since it uses less digits than its factorization.
77000000077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52647 (or 52629 counting only the distinct ones).
The product of its (nonzero) digits is 2401, while the sum is 28.
It can be divided in two parts, 770000000 and 77, that added together give a palindrome (770000077).
The spelling of 77000000077 in words is "seventy-seven billion, seventy-seven", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •