Base | Representation |
---|---|
bin | 101100100101000000001… |
… | …0111101110001000011100 |
3 | 210200201021121221210020120 |
4 | 1121022000113232020130 |
5 | 1300340114412103022 |
6 | 21010334051314540 |
7 | 1201434150536421 |
oct | 131120027561034 |
9 | 23621247853216 |
10 | 6126777066012 |
11 | 1a52395a24579 |
12 | 82b4b12aba50 |
13 | 3559a25c60a5 |
14 | 17277521dd48 |
15 | a9588dbcd5c |
hex | 592805ee21c |
6126777066012 has 12 divisors (see below), whose sum is σ = 14295813154056. Its totient is φ = 2042259022000.
The previous prime is 6126777065993. The next prime is 6126777066077. The reversal of 6126777066012 is 2106607776216.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×61267770660122 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 255282377739 + ... + 255282377762.
It is an arithmetic number, because the mean of its divisors is an integer number (1191317762838).
Almost surely, 26126777066012 is an apocalyptic number.
It is an amenable number.
6126777066012 is an abundant number, since it is smaller than the sum of its proper divisors (8169036088044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6126777066012 is a wasteful number, since it uses less digits than its factorization.
6126777066012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510564755508 (or 510564755506 counting only the distinct ones).
The product of its (nonzero) digits is 1778112, while the sum is 51.
The spelling of 6126777066012 in words is "six trillion, one hundred twenty-six billion, seven hundred seventy-seven million, sixty-six thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •