Search a number
-
+
112110200212 = 2228027550053
BaseRepresentation
bin110100001101001001…
…0011110010110010100
3101201101011010020212111
41220122102132112110
53314100202401322
6123300330400404
711046123656443
oct1503222362624
9351334106774
10112110200212
114360031582a
1219889590104
13a75874979a
1455d7566d5a
152db24c7177
hex1a1a49e594

112110200212 has 6 divisors (see below), whose sum is σ = 196192850378. Its totient is φ = 56055100104.

The previous prime is 112110200183. The next prime is 112110200231. The reversal of 112110200212 is 212002011211.

It can be written as a sum of positive squares in only one way, i.e., 109141693956 + 2968506256 = 330366^2 + 54484^2 .

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

It is a congruent number.

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, 14013775023 + ... + 14013775030.

Almost surely, 2112110200212 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 28027550057 (or 28027550055 counting only the distinct ones).

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

Adding to 112110200212 its reverse (212002011211), we get a palindrome (324112211423).

The spelling of 112110200212 in words is "one hundred twelve billion, one hundred ten million, two hundred thousand, two hundred twelve".

Divisors: 1 2 4 28027550053 56055100106 112110200212