Search a number
-
+
110112011200002 = 2372621714552381
BaseRepresentation
bin11001000010010101110011…
…010100000010011000000010
3112102212121100101101022020010
4121002111303110002120002
5103413033344331400002
61030104432024325350
732123221200150060
oct3102256324023002
9472777311338203
10110112011200002
11320a3272787669
1210424541913856
134959697367526
141d29642297030
15cae3ed18146c
hex642573502602

110112011200002 has 16 divisors (see below), whose sum is σ = 251684597028672. Its totient is φ = 31460574628560.

The previous prime is 110112011199979. The next prime is 110112011200003. The reversal of 110112011200002 is 200002110211011.

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

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 in 7 ways as a sum of consecutive naturals, for example, 1310857276149 + ... + 1310857276232.

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

Almost surely, 2110112011200002 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 2621714552393.

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

Adding to 110112011200002 its reverse (200002110211011), we get a palindrome (310114121411013).

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

Divisors: 1 2 3 6 7 14 21 42 2621714552381 5243429104762 7865143657143 15730287314286 18352001866667 36704003733334 55056005600001 110112011200002