Base | Representation |
---|---|
bin | 1010000110010011001000… |
… | …1011000100000100011011 |
3 | 1110022110122022110101201112 |
4 | 2201210302023010010123 |
5 | 2423404111022034321 |
6 | 35340444515410535 |
7 | 2224121631443426 |
oct | 241446213040433 |
9 | 43273568411645 |
10 | 11103332221211 |
11 | 35a099563713a |
12 | 12b3a975b3a4b |
13 | 6270693b7b09 |
14 | 2a5592d9c9bd |
15 | 143c5320da5b |
hex | a19322c411b |
11103332221211 has 8 divisors (see below), whose sum is σ = 11768121033840. Its totient is φ = 10439838033408.
The previous prime is 11103332221193. The next prime is 11103332221213. The reversal of 11103332221211 is 11212223330111.
It is a happy number.
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 11103332221211 - 210 = 11103332220187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11103332221213) 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 7 ways as a sum of consecutive naturals, for example, 323638541 + ... + 323672846.
It is an arithmetic number, because the mean of its divisors is an integer number (1471015129230).
Almost surely, 211103332221211 is an apocalyptic number.
11103332221211 is a deficient number, since it is larger than the sum of its proper divisors (664788812629).
11103332221211 is a wasteful number, since it uses less digits than its factorization.
11103332221211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 647312413.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11103332221211 its reverse (11212223330111), we get a palindrome (22315555551322).
The spelling of 11103332221211 in words is "eleven trillion, one hundred three billion, three hundred thirty-two million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •