Base | Representation |
---|---|
bin | 10100101110111011… |
… | …00001001000100100 |
3 | 1001201202000000111011 |
4 | 22113131201020210 |
5 | 140244021011400 |
6 | 5040304352004 |
7 | 542560132426 |
oct | 122735411044 |
9 | 31652000434 |
10 | 11131032100 |
11 | 47a21a5191 |
12 | 21a7915604 |
13 | 1085114b36 |
14 | 77845c816 |
15 | 4523238ba |
hex | 297761224 |
11131032100 has 72 divisors (see below), whose sum is σ = 24578176896. Its totient is φ = 4375588000.
The previous prime is 11131032053. The next prime is 11131032131. The reversal of 11131032100 is 123013111.
It is a super-2 number, since 2×111310321002 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 35790945 + ... + 35791255.
It is an arithmetic number, because the mean of its divisors is an integer number (341363568).
Almost surely, 211131032100 is an apocalyptic number.
11131032100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11131032100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12289088448).
11131032100 is an abundant number, since it is smaller than the sum of its proper divisors (13447144796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11131032100 is an frugal number, since it uses more digits than its factorization.
11131032100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538 (or 389 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 11131032100 its reverse (123013111), we get a palindrome (11254045211).
The spelling of 11131032100 in words is "eleven billion, one hundred thirty-one million, thirty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •