Base | Representation |
---|---|
bin | 1010001101110010111100… |
… | …1100001101111100011000 |
3 | 1110202210002112111000002212 |
4 | 2203130233030031330120 |
5 | 2433011401042223112 |
6 | 35515545253014252 |
7 | 2236331453004404 |
oct | 243345714157430 |
9 | 43683075430085 |
10 | 11232131211032 |
11 | 364057a27a576 |
12 | 1314a42024388 |
13 | 636254503424 |
14 | 2ab8d0b54104 |
15 | 1472908d7522 |
hex | a372f30df18 |
11232131211032 has 8 divisors (see below), whose sum is σ = 21060246020700. Its totient is φ = 5616065605512.
The previous prime is 11232131211017. The next prime is 11232131211047. The reversal of 11232131211032 is 23011213123211.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11232131211017) and next prime (11232131211047).
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 11232131210989 and 11232131211007.
It is a congruent number.
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 as a sum of consecutive naturals, namely, 702008200682 + ... + 702008200697.
Almost surely, 211232131211032 is an apocalyptic number.
It is an amenable number.
11232131211032 is a deficient number, since it is larger than the sum of its proper divisors (9828114809668).
11232131211032 is a wasteful number, since it uses less digits than its factorization.
11232131211032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1404016401385 (or 1404016401381 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11232131211032 its reverse (23011213123211), we get a palindrome (34243344334243).
The spelling of 11232131211032 in words is "eleven trillion, two hundred thirty-two billion, one hundred thirty-one million, two hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •