Base | Representation |
---|---|
bin | 10111011011001001… |
… | …01111000011001000 |
3 | 1012110102112001000020 |
4 | 23231210233003020 |
5 | 201223343432210 |
6 | 5435514140440 |
7 | 623432143653 |
oct | 135544570310 |
9 | 35412461006 |
10 | 12575764680 |
11 | 5373767156 |
12 | 252b721720 |
13 | 125552629b |
14 | 87429689a |
15 | 4d90a2770 |
hex | 2ed92f0c8 |
12575764680 has 32 divisors (see below), whose sum is σ = 37727294400. Its totient is φ = 3353537216.
The previous prime is 12575764661. The next prime is 12575764741. The reversal of 12575764680 is 8646757521.
12575764680 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52398900 + ... + 52399139.
It is an arithmetic number, because the mean of its divisors is an integer number (1178977950).
Almost surely, 212575764680 is an apocalyptic number.
12575764680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12575764680 is an abundant number, since it is smaller than the sum of its proper divisors (25151529720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12575764680 is a wasteful number, since it uses less digits than its factorization.
12575764680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104798053 (or 104798049 counting only the distinct ones).
The product of its (nonzero) digits is 2822400, while the sum is 51.
The spelling of 12575764680 in words is "twelve billion, five hundred seventy-five million, seven hundred sixty-four thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •