Search a number
-
+
1011110220121 = 41883246711321
BaseRepresentation
bin11101011011010101101…
…11011001000101011001
310120122212000021002022011
432231222313121011121
5113031223204020441
62052255253025521
7133023153031231
oct16555267310531
93518760232264
101011110220121
1135a89a3a57a1
12143b629252a1
1374468ca47a1
1436d1bc08cc1
151b47bd28581
hexeb6add9159

1011110220121 has 16 divisors (see below), whose sum is σ = 1037456417088. Its totient is φ = 984845433600.

The previous prime is 1011110220083. The next prime is 1011110220149. The reversal of 1011110220121 is 1210220111101.

It is a happy number.

It is a cyclic number.

It is not a de Polignac number, because 1011110220121 - 27 = 1011110219993 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1011110220151) 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 15 ways as a sum of consecutive naturals, for example, 89307141 + ... + 89318461.

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

Almost surely, 21011110220121 is an apocalyptic number.

It is an amenable number.

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

1011110220121 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 14712.

The product of its (nonzero) digits is 8, while the sum is 13.

Adding to 1011110220121 its reverse (1210220111101), we get a palindrome (2221330331222).

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

Divisors: 1 41 883 2467 11321 36203 101147 464161 2178361 9996443 27928907 89312801 409854163 1145085187 24661224881 1011110220121