Search a number
-
+
110122010112 = 293307347673
BaseRepresentation
bin110011010001111001…
…0001000011000000000
3101112020120222201210010
41212203302020120000
53301012213310422
6122331144504520
710645632433032
oct1464362103000
9345216881703
10110122010112
1142780005114
121941377b140
13a4cc878a3a
1454894a3c52
152ce7b98b0c
hex19a3c88600

110122010112 has 160 divisors (see below), whose sum is σ = 295614329472. Its totient is φ = 36428120064.

The previous prime is 110122010101. The next prime is 110122010113. The reversal of 110122010112 is 211010221011.

110122010112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

It is a Harshad number since it is a multiple of its sum of digits (12).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110122010113) by changing a digit.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 163628208 + ... + 163628880.

Almost surely, 2110122010112 is an apocalyptic number.

110122010112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 110122010112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147807164736).

110122010112 is an abundant number, since it is smaller than the sum of its proper divisors (185492319360).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 110122010112 its reverse (211010221011), we get a palindrome (321132231123).

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

Divisors: 1 2 3 4 6 8 12 16 24 32 48 64 96 128 192 256 307 347 384 512 614 673 694 768 921 1041 1228 1346 1388 1536 1842 2019 2082 2456 2692 2776 3684 4038 4164 4912 5384 5552 7368 8076 8328 9824 10768 11104 14736 16152 16656 19648 21536 22208 29472 32304 33312 39296 43072 44416 58944 64608 66624 78592 86144 88832 106529 117888 129216 133248 157184 172288 177664 206611 213058 233531 235776 258432 266496 319587 344576 413222 426116 467062 471552 516864 532992 619833 639174 700593 826444 852232 934124 1033728 1239666 1278348 1401186 1652888 1704464 1868248 2479332 2556696 2802372 3305776 3408928 3736496 4958664 5113392 5604744 6611552 6817856 7472992 9917328 10226784 11209488 13223104 13635712 14945984 19834656 20453568 22418976 26446208 27271424 29891968 39669312 40907136 44837952 52892416 54542848 59783936 71694017 79338624 81814272 89675904 105784832 119567872 143388034 158677248 163628544 179351808 215082051 286776068 317354496 358703616 430164102 573552136 860328204 1147104272 1720656408 2294208544 3441312816 4588417088 6882625632 9176834176 13765251264 18353668352 27530502528 36707336704 55061005056 110122010112