Base | Representation |
---|---|
bin | 11111000001110001101… |
… | …011100101100001110100 |
3 | 21112211121110020001201210 |
4 | 133001301223211201310 |
5 | 234413232010431012 |
6 | 4311305122121420 |
7 | 310022114501301 |
oct | 37016153454164 |
9 | 7484543201653 |
10 | 2132211030132 |
11 | 7522a15a3647 |
12 | 2a52a11b0270 |
13 | 1260b352cc51 |
14 | 752b18680a8 |
15 | 3a6e4edb23c |
hex | 1f071ae5874 |
2132211030132 has 48 divisors (see below), whose sum is σ = 5137349640192. Its totient is φ = 687582121440.
The previous prime is 2132211030127. The next prime is 2132211030139. The reversal of 2132211030132 is 2310301122312.
It is a super-2 number, since 2×21322110301322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2132211030099 and 2132211030108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2132211030139) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 176533 + ... + 2072579.
It is an arithmetic number, because the mean of its divisors is an integer number (107028117504).
Almost surely, 22132211030132 is an apocalyptic number.
It is an amenable number.
2132211030132 is an abundant number, since it is smaller than the sum of its proper divisors (3005138610060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2132211030132 is a wasteful number, since it uses less digits than its factorization.
2132211030132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1899108 (or 1899106 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 2132211030132 its reverse (2310301122312), we get a palindrome (4442512152444).
The spelling of 2132211030132 in words is "two trillion, one hundred thirty-two billion, two hundred eleven million, thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •