Search a number
11110120110101 = 71177898796479
BaseRepresentation
bin1010000110101100011011…
…0000110011100000010101
31110100010011101001212202202
42201223012300303200111
52424012011222010401
635343530235414245
72224452063524105
oct241530660634025
943303141055682
1011110120110101
1135a3859186571
1212b52708b4385
136278ab78600c
142a5a386a3205
15143eee0ca06b
hexa1ac6c33815

11110120110101 has 8 divisors (see below), whose sum is σ = 11267235302400. Its totient is φ = 10953022546480.

The previous prime is 11110120110077. The next prime is 11110120110107. The reversal of 11110120110101 is 10101102101111.

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 a de Polignac number, because none of the positive numbers 2k-11110120110101 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 (11110120110107) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3135221 + ... + 5661258.

It is an arithmetic number, because the mean of its divisors is an integer number (1408404412800).

Almost surely, 211110120110101 is an apocalyptic number.

It is an amenable number.

11110120110101 is a deficient number, since it is larger than the sum of its proper divisors (157115192299).

11110120110101 is an equidigital number, since it uses as much as digits as its factorization.

11110120110101 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 8814339.

The product of its (nonzero) digits is 2, while the sum is 11.

Adding to 11110120110101 its reverse (10101102101111), we get a palindrome (21211222211212).

The spelling of 11110120110101 in words is "eleven trillion, one hundred ten billion, one hundred twenty million, one hundred ten thousand, one hundred one".