Base | Representation |
---|---|
bin | 10100110111001011… |
… | …11000000011101100 |
3 | 1001220120101211002120 |
4 | 22123211320003230 |
5 | 140414241111022 |
6 | 5051221552540 |
7 | 544361152122 |
oct | 123345700354 |
9 | 31816354076 |
10 | 11200332012 |
11 | 4828328241 |
12 | 2206b75750 |
13 | 1096599abc |
14 | 78373b912 |
15 | 458461d5c |
hex | 29b9780ec |
11200332012 has 48 divisors (see below), whose sum is σ = 26889216480. Its totient is φ = 3625938432.
The previous prime is 11200332001. The next prime is 11200332029. The reversal of 11200332012 is 21023300211.
11200332012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11200331982 and 11200332000.
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 15 ways as a sum of consecutive naturals, for example, 224664 + ... + 269952.
It is an arithmetic number, because the mean of its divisors is an integer number (560192010).
Almost surely, 211200332012 is an apocalyptic number.
11200332012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11200332012 is an abundant number, since it is smaller than the sum of its proper divisors (15688884468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11200332012 is a wasteful number, since it uses less digits than its factorization.
11200332012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45890 (or 45888 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 11200332012 its reverse (21023300211), we get a palindrome (32223632223).
The spelling of 11200332012 in words is "eleven billion, two hundred million, three hundred thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •