Base | Representation |
---|---|
bin | 1001011111100111110111… |
… | …10111110101110000100001 |
3 | 2201220220011110111212211022 |
4 | 10233303323313311300201 |
5 | 10214030131243343024 |
6 | 112223040314255225 |
7 | 4253240344360610 |
oct | 457637367656041 |
9 | 81826143455738 |
10 | 20877766777889 |
11 | 671a236077aaa |
12 | 2412301a27515 |
13 | b859c38010c8 |
14 | 5226bc913877 |
15 | 26312a56635e |
hex | 12fcfbdf5c21 |
20877766777889 has 48 divisors (see below), whose sum is σ = 25858943953920. Its totient is φ = 16491038551680.
The previous prime is 20877766777871. The next prime is 20877766777919. The reversal of 20877766777889 is 98877766777802.
It is not a de Polignac number, because 20877766777889 - 28 = 20877766777633 is a prime.
It is a super-2 number, since 2×208777667778892 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20877766777289) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 49294544 + ... + 49716270.
It is an arithmetic number, because the mean of its divisors is an integer number (538727999040).
Almost surely, 220877766777889 is an apocalyptic number.
20877766777889 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
It is an amenable number.
20877766777889 is a deficient number, since it is larger than the sum of its proper divisors (4981177176031).
20877766777889 is a wasteful number, since it uses less digits than its factorization.
20877766777889 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 422270 (or 422247 counting only the distinct ones).
The product of its (nonzero) digits is 39033114624, while the sum is 89.
The spelling of 20877766777889 in words is "twenty trillion, eight hundred seventy-seven billion, seven hundred sixty-six million, seven hundred seventy-seven thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •