Search a number
-
+
112111020122 = 256055510061
BaseRepresentation
bin110100001101001010…
…1100110100001011010
3101201101012122220120112
41220122111212201122
53314100410120442
6123300400124322
711046133643033
oct1503225464132
9351335586515
10112111020122
1143600825842
12198899066a2
13a758975a3a
1455d76dba8a
152db25da082
hex1a1a56685a

112111020122 has 4 divisors (see below), whose sum is σ = 168166530186. Its totient is φ = 56055510060.

The previous prime is 112111020059. The next prime is 112111020157. The reversal of 112111020122 is 221020111211.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 71802025681 + 40308994441 = 267959^2 + 200771^2 .

It is a junction number, because it is equal to n+sod(n) for n = 112111020097 and 112111020106.

It is an unprimeable number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28027755029 + ... + 28027755032.

Almost surely, 2112111020122 is an apocalyptic number.

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

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

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

The sum of its prime factors is 56055510063.

The product of its (nonzero) digits is 16, while the sum is 14.

Adding to 112111020122 its reverse (221020111211), we get a palindrome (333131131333).

The spelling of 112111020122 in words is "one hundred twelve billion, one hundred eleven million, twenty thousand, one hundred twenty-two".

Divisors: 1 2 56055510061 112111020122