Base | Representation |
---|---|
bin | 1010000111111110101101… |
… | …1011110110100100111100 |
3 | 1110102020011212111021121210 |
4 | 2201333223123312210330 |
5 | 2424342231303224012 |
6 | 35402022231124420 |
7 | 2226163355346033 |
oct | 241775333664474 |
9 | 43366155437553 |
10 | 11132210211132 |
11 | 36021644a240a |
12 | 12b95b6813710 |
13 | 6299bc193c0a |
14 | 2a6b323b971a |
15 | 1448935a523c |
hex | a1feb6f693c |
11132210211132 has 24 divisors (see below), whose sum is σ = 26031259023616. Its totient is φ = 3702722185008.
The previous prime is 11132210211127. The next prime is 11132210211193. The reversal of 11132210211132 is 23111201223111.
It is a super-2 number, since 2×111322102111322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11132210211099 and 11132210211108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1001813218 + ... + 1001824329.
Almost surely, 211132210211132 is an apocalyptic number.
11132210211132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11132210211132 is an abundant number, since it is smaller than the sum of its proper divisors (14899048812484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11132210211132 is a wasteful number, since it uses less digits than its factorization.
11132210211132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2003638017 (or 2003638015 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 11132210211132 its reverse (23111201223111), we get a palindrome (34243411434243).
The spelling of 11132210211132 in words is "eleven trillion, one hundred thirty-two billion, two hundred ten million, two hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •