Base | Representation |
---|---|
bin | 1010000110011011100101… |
… | …1001110010011000110111 |
3 | 1110022200111102120120010212 |
4 | 2201212321121302120313 |
5 | 2423423232324130421 |
6 | 35341502003340035 |
7 | 2224232101002644 |
oct | 241467131623067 |
9 | 43280442516125 |
10 | 11105601005111 |
11 | 35a194a277058 |
12 | 12b440b38161b |
13 | 62733b4505b2 |
14 | 2a572a422dcb |
15 | 143d374b5e5b |
hex | a19b9672637 |
11105601005111 has 4 divisors (see below), whose sum is σ = 11161974614472. Its totient is φ = 11049227395752.
The previous prime is 11105601005047. The next prime is 11105601005117. The reversal of 11105601005111 is 11150010650111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11105601005111 - 26 = 11105601005047 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 (11105601005117) 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 3 ways as a sum of consecutive naturals, for example, 28186804385 + ... + 28186804778.
It is an arithmetic number, because the mean of its divisors is an integer number (2790493653618).
Almost surely, 211105601005111 is an apocalyptic number.
11105601005111 is a deficient number, since it is larger than the sum of its proper divisors (56373609361).
11105601005111 is an equidigital number, since it uses as much as digits as its factorization.
11105601005111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56373609360.
The product of its (nonzero) digits is 150, while the sum is 23.
Adding to 11105601005111 its reverse (11150010650111), we get a palindrome (22255611655222).
The spelling of 11105601005111 in words is "eleven trillion, one hundred five billion, six hundred one million, five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •