Base | Representation |
---|---|
bin | 1011100111011010000001… |
… | …1100100101101101000111 |
3 | 1200012221210211100012211201 |
4 | 2321312200130211231013 |
5 | 3133222244140320124 |
6 | 43055112230443331 |
7 | 2455501613402353 |
oct | 271664034455507 |
9 | 50187724305751 |
10 | 12771629620039 |
11 | 4084465a68194 |
12 | 1523288b03547 |
13 | 718489aaac84 |
14 | 322216100463 |
15 | 1723456d9144 |
hex | b9da0725b47 |
12771629620039 has 8 divisors (see below), whose sum is σ = 12799755393632. Its totient is φ = 12743530446240.
The previous prime is 12771629620037. The next prime is 12771629620133. The reversal of 12771629620039 is 93002692617721.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12771629620039 - 21 = 12771629620037 is a prime.
It is a super-2 number, since 2×127716296200392 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12771629620031) 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 7 ways as a sum of consecutive naturals, for example, 5688459 + ... + 7609324.
It is an arithmetic number, because the mean of its divisors is an integer number (1599969424204).
Almost surely, 212771629620039 is an apocalyptic number.
12771629620039 is a deficient number, since it is larger than the sum of its proper divisors (28125773593).
12771629620039 is a wasteful number, since it uses less digits than its factorization.
12771629620039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13299897.
The product of its (nonzero) digits is 3429216, while the sum is 55.
The spelling of 12771629620039 in words is "twelve trillion, seven hundred seventy-one billion, six hundred twenty-nine million, six hundred twenty thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •