Search a number
-
+
110022121012 = 22191447659487
BaseRepresentation
bin110011001110111010…
…1000101011000110100
3101111222122000211200211
41212131311011120310
53300311130333022
6122313215515204
710643310412126
oct1463565053064
9344878024624
10110022121012
1142729689a41
12193a6228b04
13a4b4c7386b
14547a101216
152cde016e77
hex199dd45634

110022121012 has 12 divisors (see below), whose sum is σ = 202672328320. Its totient is φ = 52115741496.

The previous prime is 110022120991. The next prime is 110022121051. The reversal of 110022121012 is 210121220011.

It is a super-2 number, since 2×1100221210122 (a number of 23 digits) contains 22 as substring.

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 723829668 + ... + 723829819.

Almost surely, 2110022121012 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110022121012 its reverse (210121220011), we get a palindrome (320143341023).

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

Divisors: 1 2 4 19 38 76 1447659487 2895318974 5790637948 27505530253 55011060506 110022121012