Base | Representation |
---|---|
bin | 10100101011100000… |
… | …10011001100011111 |
3 | 1001122202010102102120 |
4 | 22111300103030133 |
5 | 140214203320221 |
6 | 5033402554023 |
7 | 542061565641 |
oct | 122560231437 |
9 | 31582112376 |
10 | 11102401311 |
11 | 478801a481 |
12 | 219a208913 |
13 | 107c1cc141 |
14 | 774728891 |
15 | 44ea6a5c6 |
hex | 295c1331f |
11102401311 has 8 divisors (see below), whose sum is σ = 14805590400. Its totient is φ = 7400406552.
The previous prime is 11102401301. The next prime is 11102401333. The reversal of 11102401311 is 11310420111.
11102401311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11102401311 - 27 = 11102401183 is a prime.
It is a super-3 number, since 3×111024013113 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102401301) 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, 276661 + ... + 314238.
It is an arithmetic number, because the mean of its divisors is an integer number (1850698800).
Almost surely, 211102401311 is an apocalyptic number.
11102401311 is a deficient number, since it is larger than the sum of its proper divisors (3703189089).
11102401311 is an equidigital number, since it uses as much as digits as its factorization.
11102401311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 597165.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11102401311 its reverse (11310420111), we get a palindrome (22412821422).
The spelling of 11102401311 in words is "eleven billion, one hundred two million, four hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •