Base | Representation |
---|---|
bin | 10111101101011000… |
… | …00001101101110000 |
3 | 1012212002020111011112 |
4 | 23312230001231300 |
5 | 202032014433323 |
6 | 5503015332452 |
7 | 630266630150 |
oct | 136654015560 |
9 | 35762214145 |
10 | 12728671088 |
11 | 5442003a91 |
12 | 2572981128 |
13 | 127b102053 |
14 | 88a6da760 |
15 | 4e7708178 |
hex | 2f6b01b70 |
12728671088 has 20 divisors (see below), whose sum is σ = 28184914800. Its totient is φ = 5455144704.
The previous prime is 12728671019. The next prime is 12728671157. The reversal of 12728671088 is 88017682721.
12728671088 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12728671019) and next prime (12728671157).
It is a super-3 number, since 3×127286710883 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 56824313 + ... + 56824536.
It is an arithmetic number, because the mean of its divisors is an integer number (1409245740).
Almost surely, 212728671088 is an apocalyptic number.
It is an amenable number.
12728671088 is an abundant number, since it is smaller than the sum of its proper divisors (15456243712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12728671088 is a wasteful number, since it uses less digits than its factorization.
12728671088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113648864 (or 113648858 counting only the distinct ones).
The product of its (nonzero) digits is 602112, while the sum is 50.
The spelling of 12728671088 in words is "twelve billion, seven hundred twenty-eight million, six hundred seventy-one thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •