Base | Representation |
---|---|
bin | 1010000111110010000111… |
… | …0111000100010011011100 |
3 | 1110101220110011220211000100 |
4 | 2201330201313010103130 |
5 | 2424313320024110422 |
6 | 35400302502101100 |
7 | 2226013512106443 |
oct | 241744167042334 |
9 | 43356404824010 |
10 | 11128828347612 |
11 | 3600789524288 |
12 | 12b8a1211a790 |
13 | 6295a064b241 |
14 | 2a68d11add5a |
15 | 1447467317ac |
hex | a1f21dc44dc |
11128828347612 has 72 divisors (see below), whose sum is σ = 28554804286736. Its totient is φ = 3653764671744.
The previous prime is 11128828347563. The next prime is 11128828347617. The reversal of 11128828347612 is 21674382882111.
11128828347612 is a `hidden beast` number, since 1 + 1 + 1 + 2 + 8 + 82 + 83 + 476 + 12 = 666.
It is a super-2 number, since 2×111288283476122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11128828347617) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18402678 + ... + 18997794.
Almost surely, 211128828347612 is an apocalyptic number.
11128828347612 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11128828347612 is an abundant number, since it is smaller than the sum of its proper divisors (17425975939124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11128828347612 is a wasteful number, since it uses less digits than its factorization.
11128828347612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 602947 (or 602942 counting only the distinct ones).
The product of its digits is 2064384, while the sum is 54.
The spelling of 11128828347612 in words is "eleven trillion, one hundred twenty-eight billion, eight hundred twenty-eight million, three hundred forty-seven thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •