Base | Representation |
---|---|
bin | 10100111000011110… |
… | …00001111000000100 |
3 | 1001221022200220121120 |
4 | 22130033001320010 |
5 | 140430021321012 |
6 | 5052245113540 |
7 | 544551643302 |
oct | 123417017004 |
9 | 31838626546 |
10 | 11211120132 |
11 | 4833426543 |
12 | 220a6b88b0 |
13 | 10988a62c4 |
14 | 784d49272 |
15 | 45939358c |
hex | 29c3c1e04 |
11211120132 has 24 divisors (see below), whose sum is σ = 26767636896. Its totient is φ = 3650131968.
The previous prime is 11211120131. The next prime is 11211120229. The reversal of 11211120132 is 23102111211.
It is a super-2 number, since 2×112111201322 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11211120131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10862973 + ... + 10864004.
It is an arithmetic number, because the mean of its divisors is an integer number (1115318204).
Almost surely, 211211120132 is an apocalyptic number.
11211120132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11211120132 is an abundant number, since it is smaller than the sum of its proper divisors (15556516764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11211120132 is a wasteful number, since it uses less digits than its factorization.
11211120132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21727027 (or 21727025 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11211120132 its reverse (23102111211), we get a palindrome (34313231343).
It can be divided in two parts, 1121 and 1120132, that added together give a triangular number (1121253 = T1497).
The spelling of 11211120132 in words is "eleven billion, two hundred eleven million, one hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •