Base | Representation |
---|---|
bin | 1011100111000000000011… |
… | …0101010011001110000111 |
3 | 1200012021210212201001010102 |
4 | 2321300000311103032013 |
5 | 3133114004113313241 |
6 | 43052000302314315 |
7 | 2455134044245244 |
oct | 271600065231607 |
9 | 50167725631112 |
10 | 12764656776071 |
11 | 4081507a81322 |
12 | 1521a6188899b |
13 | 7179182c26b5 |
14 | 321b540125cb |
15 | 17208848639b |
hex | b9c00d53387 |
12764656776071 has 4 divisors (see below), whose sum is σ = 12865165884672. Its totient is φ = 12664147667472.
The previous prime is 12764656776061. The next prime is 12764656776097. The reversal of 12764656776071 is 17067765646721.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12764656776071 is a prime.
It is a super-2 number, since 2×127646567760712 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12764656775989 and 12764656776007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12764656776061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50254554110 + ... + 50254554363.
It is an arithmetic number, because the mean of its divisors is an integer number (3216291471168).
Almost surely, 212764656776071 is an apocalyptic number.
12764656776071 is a deficient number, since it is larger than the sum of its proper divisors (100509108601).
12764656776071 is a wasteful number, since it uses less digits than its factorization.
12764656776071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100509108600.
The product of its (nonzero) digits is 124467840, while the sum is 65.
The spelling of 12764656776071 in words is "twelve trillion, seven hundred sixty-four billion, six hundred fifty-six million, seven hundred seventy-six thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •