Base | Representation |
---|---|
bin | 10100101011001110… |
… | …10000111111110100 |
3 | 1001122120200002201210 |
4 | 22111213100333310 |
5 | 140213102024022 |
6 | 5033240121420 |
7 | 542032503165 |
oct | 122547207764 |
9 | 31576602653 |
10 | 11100033012 |
11 | 4786752102 |
12 | 2199466270 |
13 | 107b880193 |
14 | 7742ad76c |
15 | 44e74da0c |
hex | 2959d0ff4 |
11100033012 has 12 divisors (see below), whose sum is σ = 25900077056. Its totient is φ = 3700011000.
The previous prime is 11100033001. The next prime is 11100033083. The reversal of 11100033012 is 21033000111.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 925002751 = 11100033012 / (1 + 1 + 1 + 0 + 0 + 0 + 3 + 3 + 0 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 462501364 + ... + 462501387.
Almost surely, 211100033012 is an apocalyptic number.
11100033012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11100033012 is an abundant number, since it is smaller than the sum of its proper divisors (14800044044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100033012 is a wasteful number, since it uses less digits than its factorization.
11100033012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 925002758 (or 925002756 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 11100033012 its reverse (21033000111), we get a palindrome (32133033123).
The spelling of 11100033012 in words is "eleven billion, one hundred million, thirty-three thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •