Base | Representation |
---|---|
bin | 11110111111111010100… |
… | …010011001010100100100 |
3 | 21112122110010221112011112 |
4 | 132333322202121110210 |
5 | 234400133301212012 |
6 | 4310334514524152 |
7 | 306621433236320 |
oct | 36777242312444 |
9 | 7478403845145 |
10 | 2130212132132 |
11 | 751466239a27 |
12 | 2a4a23896658 |
13 | 125b55380376 |
14 | 751621b8980 |
15 | 3a629795122 |
hex | 1effa899524 |
2130212132132 has 48 divisors (see below), whose sum is σ = 4270417831680. Its totient is φ = 910807286400.
The previous prime is 2130212132123. The next prime is 2130212132179. The reversal of 2130212132132 is 2312312120312.
It is a super-2 number, since 2×21302121321322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2130212132098 and 2130212132107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 99910169 + ... + 99931487.
It is an arithmetic number, because the mean of its divisors is an integer number (88967038160).
Almost surely, 22130212132132 is an apocalyptic number.
It is an amenable number.
2130212132132 is an abundant number, since it is smaller than the sum of its proper divisors (2140205699548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2130212132132 is a wasteful number, since it uses less digits than its factorization.
2130212132132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29532 (or 29530 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 2130212132132 its reverse (2312312120312), we get a palindrome (4442524252444).
The spelling of 2130212132132 in words is "two trillion, one hundred thirty billion, two hundred twelve million, one hundred thirty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •