Base | Representation |
---|---|
bin | 10100110111010100… |
… | …00010101111001100 |
3 | 1001220122110022110212 |
4 | 22123222002233030 |
5 | 140420031034312 |
6 | 5051301221552 |
7 | 544403351540 |
oct | 123352025714 |
9 | 31818408425 |
10 | 11201424332 |
11 | 4828a0398a |
12 | 22074018b8 |
13 | 1096890047 |
14 | 783943a20 |
15 | 4585ca822 |
hex | 29ba82bcc |
11201424332 has 12 divisors (see below), whose sum is σ = 22402848720. Its totient is φ = 4800610416.
The previous prime is 11201424329. The next prime is 11201424341. The reversal of 11201424332 is 23342410211.
11201424332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
11201424332 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11201424298 and 11201424307.
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, 200025407 + ... + 200025462.
It is an arithmetic number, because the mean of its divisors is an integer number (1866904060).
Almost surely, 211201424332 is an apocalyptic number.
It is an amenable number.
11201424332 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11201424332 is a wasteful number, since it uses less digits than its factorization.
11201424332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400050880 (or 400050878 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 11201424332 its reverse (23342410211), we get a palindrome (34543834543).
The spelling of 11201424332 in words is "eleven billion, two hundred one million, four hundred twenty-four thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •