Search a number
-
+
110112100212002 = 2715152087086193
BaseRepresentation
bin11001000010010101111000…
…100111100101110100100010
3112102212121120120212120201212
4121002111320213211310202
5103413034040123241002
61030104444524230122
732123223330556220
oct3102257047456442
9472777516776655
10110112100212002
11320a3308a536a9
121042456769b342
1349596ac931855
141d29650027b10
15cae405db5352
hex6425789e5d22

110112100212002 has 16 divisors (see below), whose sum is σ = 190013690435712. Its totient is φ = 46878377572800.

The previous prime is 110112100211969. The next prime is 110112100212017. The reversal of 110112100212002 is 200212001211011.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26043540983 + ... + 26043545210.

It is an arithmetic number, because the mean of its divisors is an integer number (11875855652232).

Almost surely, 2110112100212002 is an apocalyptic number.

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

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

110112100212002 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 52087086353.

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

Adding to 110112100212002 its reverse (200212001211011), we get a palindrome (310324101423013).

Subtracting 110112100212002 from its reverse (200212001211011), we obtain a palindrome (90099900999009).

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

Divisors: 1 2 7 14 151 302 1057 2114 52087086193 104174172386 364609603351 729219206702 7865150015143 15730300030286 55056050106001 110112100212002