Base | Representation |
---|---|
bin | 1010000110001111000100… |
… | …1010011111000011011011 |
3 | 1110022100211022011120212001 |
4 | 2201203301022133003123 |
5 | 2423344342314104210 |
6 | 35340144354501431 |
7 | 2224052616054541 |
oct | 241436112370333 |
9 | 43270738146761 |
10 | 11102241550555 |
11 | 35a0485a14131 |
12 | 12b3832294877 |
13 | 626c2445266c |
14 | 2a54cc1abd91 |
15 | 143bdc5bc03a |
hex | a18f129f0db |
11102241550555 has 8 divisors (see below), whose sum is σ = 13322720335392. Its totient is φ = 8881772923968.
The previous prime is 11102241550553. The next prime is 11102241550571. The reversal of 11102241550555 is 55505514220111.
11102241550555 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 a cyclic number.
It is not a de Polignac number, because 11102241550555 - 21 = 11102241550553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11102241550553) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 117639 + ... + 4713631.
It is an arithmetic number, because the mean of its divisors is an integer number (1665340041924).
Almost surely, 211102241550555 is an apocalyptic number.
11102241550555 is a deficient number, since it is larger than the sum of its proper divisors (2220478784837).
11102241550555 is an equidigital number, since it uses as much as digits as its factorization.
11102241550555 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5079125.
The product of its (nonzero) digits is 50000, while the sum is 37.
Adding to 11102241550555 its reverse (55505514220111), we get a palindrome (66607755770666).
The spelling of 11102241550555 in words is "eleven trillion, one hundred two billion, two hundred forty-one million, five hundred fifty thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •