Base | Representation |
---|---|
bin | 1010000110001111011000… |
… | …0011010011000011111111 |
3 | 1110022101001000110201101112 |
4 | 2201203312003103003333 |
5 | 2423400024312140021 |
6 | 35340200444232235 |
7 | 2224054633056362 |
oct | 241436603230377 |
9 | 43271030421345 |
10 | 11102323552511 |
11 | 35a0518232444 |
12 | 12b385583b67b |
13 | 626c38434029 |
14 | 2a54d90360d9 |
15 | 143be48b8d5b |
hex | a18f60d30ff |
11102323552511 has 8 divisors (see below), whose sum is σ = 11254560056784. Its totient is φ = 10950091099200.
The previous prime is 11102323552487. The next prime is 11102323552559. The reversal of 11102323552511 is 11525532320111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11102323552511 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 (11102323552591) by changing a digit.
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 in 7 ways as a sum of consecutive naturals, for example, 4727720 + ... + 6675026.
It is an arithmetic number, because the mean of its divisors is an integer number (1406820007098).
Almost surely, 211102323552511 is an apocalyptic number.
11102323552511 is a deficient number, since it is larger than the sum of its proper divisors (152236504273).
11102323552511 is an equidigital number, since it uses as much as digits as its factorization.
11102323552511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2025481.
The product of its (nonzero) digits is 9000, while the sum is 32.
Adding to 11102323552511 its reverse (11525532320111), we get a palindrome (22627855872622).
The spelling of 11102323552511 in words is "eleven trillion, one hundred two billion, three hundred twenty-three million, five hundred fifty-two thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •