Base | Representation |
---|---|
bin | 1010010011100100000101… |
… | …1110000000110000011111 |
3 | 1111010020212100111101201121 |
4 | 2210321001132000300133 |
5 | 2441122320330111221 |
6 | 40033254102551411 |
7 | 2246440150533262 |
oct | 244710136006037 |
9 | 44106770441647 |
10 | 11331222113311 |
11 | 36795a952a041 |
12 | 1330097438567 |
13 | 6426b6882509 |
14 | 2b261116acd9 |
15 | 149b3ede9a41 |
hex | a4e41780c1f |
11331222113311 has 8 divisors (see below), whose sum is σ = 11412870330960. Its totient is φ = 11249575733568.
The previous prime is 11331222113297. The next prime is 11331222113329. The reversal of 11331222113311 is 11331122213311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11331222113311 - 215 = 11331222080543 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331222113371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13420425 + ... + 14239741.
It is an arithmetic number, because the mean of its divisors is an integer number (1426608791370).
Almost surely, 211331222113311 is an apocalyptic number.
11331222113311 is a deficient number, since it is larger than the sum of its proper divisors (81648217649).
11331222113311 is an equidigital number, since it uses as much as digits as its factorization.
11331222113311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918953.
The product of its digits is 648, while the sum is 25.
Adding to 11331222113311 its reverse (11331122213311), we get a palindrome (22662344326622).
The spelling of 11331222113311 in words is "eleven trillion, three hundred thirty-one billion, two hundred twenty-two million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •