Base | Representation |
---|---|
bin | 10010101100101110… |
… | …010101010100011111 |
3 | 1220211020201122112000 |
4 | 102230232111110133 |
5 | 312104342240122 |
6 | 13120142413343 |
7 | 1310354413455 |
oct | 225456252437 |
9 | 56736648460 |
10 | 20077696287 |
11 | 8573377430 |
12 | 3a83b91253 |
13 | 1b7c80c57c |
14 | d8674c9d5 |
15 | 7c79b70ac |
hex | 4acb9551f |
20077696287 has 16 divisors (see below), whose sum is σ = 32448802560. Its totient is φ = 12168300600.
The previous prime is 20077696273. The next prime is 20077696297. The reversal of 20077696287 is 78269677002.
20077696287 is a `hidden beast` number, since 2 + 0 + 0 + 7 + 7 + 6 + 9 + 628 + 7 = 666.
It is not a de Polignac number, because 20077696287 - 210 = 20077695263 is a prime.
It is a super-2 number, since 2×200776962872 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20077696297) 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, 33800539 + ... + 33801132.
It is an arithmetic number, because the mean of its divisors is an integer number (2028050160).
Almost surely, 220077696287 is an apocalyptic number.
20077696287 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
20077696287 is a deficient number, since it is larger than the sum of its proper divisors (12371106273).
20077696287 is a wasteful number, since it uses less digits than its factorization.
20077696287 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67601691 (or 67601685 counting only the distinct ones).
The product of its (nonzero) digits is 3556224, while the sum is 54.
The spelling of 20077696287 in words is "twenty billion, seventy-seven million, six hundred ninety-six thousand, two hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •