Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0011101000001111111110 |
3 | 1111010020122000122011111211 |
4 | 2210320330003220033332 |
5 | 2441122124103423402 |
6 | 40033241100435034 |
7 | 2246434665656641 |
oct | 244707403501776 |
9 | 44106560564454 |
10 | 11331131311102 |
11 | 367956224aa99 |
12 | 1330070b48a7a |
13 | 6426a0b0c3b5 |
14 | 2b2603091a58 |
15 | 149b36e604d7 |
hex | a4e3c0e83fe |
11331131311102 has 4 divisors (see below), whose sum is σ = 16996696966656. Its totient is φ = 5665565655550.
The previous prime is 11331131311081. The next prime is 11331131311207. The reversal of 11331131311102 is 20111313113311.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×113311313111022 (a number of 27 digits) contains 22 as substring.
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, 2832782827774 + ... + 2832782827777.
It is an arithmetic number, because the mean of its divisors is an integer number (4249174241664).
Almost surely, 211331131311102 is an apocalyptic number.
11331131311102 is a deficient number, since it is larger than the sum of its proper divisors (5665565655554).
11331131311102 is an equidigital number, since it uses as much as digits as its factorization.
11331131311102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5665565655553.
The product of its (nonzero) digits is 162, while the sum is 22.
Adding to 11331131311102 its reverse (20111313113311), we get a palindrome (31442444424413).
The spelling of 11331131311102 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •