Search a number
-
+
110000110112 = 253437503441
BaseRepresentation
bin110011001110010000…
…1000111101000100000
3101111221002121120102022
41212130201013220200
53300240012010422
6122311112041012
710642622336324
oct1463441075040
9344832546368
10110000110112
1142718215912
121939a993168
13a4b0538069
145477211984
152cdc11a342
hex199c847a20

110000110112 has 12 divisors (see below), whose sum is σ = 216562716846. Its totient is φ = 55000055040.

The previous prime is 110000110097. The next prime is 110000110117. The reversal of 110000110112 is 211011000011.

It is a happy number.

It can be written as a sum of positive squares in only one way, i.e., 109982436496 + 17673616 = 331636^2 + 4204^2 .

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

It is a self number, because there is not a number n which added to its sum of digits gives 110000110112.

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

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

Almost surely, 2110000110112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110000110112 its reverse (211011000011), we get a palindrome (321011110123).

The spelling of 110000110112 in words is "one hundred ten billion, one hundred ten thousand, one hundred twelve".

Divisors: 1 2 4 8 16 32 3437503441 6875006882 13750013764 27500027528 55000055056 110000110112