Base | Representation |
---|---|
bin | 1010001000000001110001… |
… | …1011001001110001100010 |
3 | 1110102022022011001010120010 |
4 | 2202000130123021301202 |
5 | 2424400422210024302 |
6 | 35402235551225350 |
7 | 2226222625364121 |
oct | 242003433116142 |
9 | 43368264033503 |
10 | 11133032111202 |
11 | 3602546431071 |
12 | 12b97a5b18256 |
13 | 629ac0544011 |
14 | 2a6bad605ab8 |
15 | 1448e080616c |
hex | a201c6c9c62 |
11133032111202 has 8 divisors (see below), whose sum is σ = 22266064222416. Its totient is φ = 3711010703732.
The previous prime is 11133032111197. The next prime is 11133032111251. The reversal of 11133032111202 is 20211123033111.
It is a sphenic number, since it is the product of 3 distinct primes.
11133032111202 is an admirable number.
It is a super-2 number, since 2×111330321112022 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 927752675928 + ... + 927752675939.
It is an arithmetic number, because the mean of its divisors is an integer number (2783258027802).
Almost surely, 211133032111202 is an apocalyptic number.
11133032111202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11133032111202 is a wasteful number, since it uses less digits than its factorization.
11133032111202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1855505351872.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 11133032111202 its reverse (20211123033111), we get a palindrome (31344155144313).
The spelling of 11133032111202 in words is "eleven trillion, one hundred thirty-three billion, thirty-two million, one hundred eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •