Base | Representation |
---|---|
bin | 11101011011100010000… |
… | …00010110010000011100 |
3 | 10120200010012002120211210 |
4 | 32231301000112100130 |
5 | 113031431041344012 |
6 | 2052313412544420 |
7 | 133025543433666 |
oct | 16556100262034 |
9 | 3520105076753 |
10 | 1011213231132 |
11 | 35a942563465 |
12 | 143b91322110 |
13 | 74484430950 |
14 | 36d2b781536 |
15 | 1b485dc523c |
hex | eb7101641c |
1011213231132 has 48 divisors (see below), whose sum is σ = 2541097546400. Its totient is φ = 311130263808.
The previous prime is 1011213231059. The next prime is 1011213231137. The reversal of 1011213231132 is 2311323121101.
It is a junction number, because it is equal to n+sod(n) for n = 1011213231099 and 1011213231108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011213231137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4340118 + ... + 4567170.
Almost surely, 21011213231132 is an apocalyptic number.
1011213231132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1011213231132 is an abundant number, since it is smaller than the sum of its proper divisors (1529884315268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011213231132 is a wasteful number, since it uses less digits than its factorization.
1011213231132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255622 (or 255620 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1011213231132 its reverse (2311323121101), we get a palindrome (3322536352233).
The spelling of 1011213231132 in words is "one trillion, eleven billion, two hundred thirteen million, two hundred thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •