Search a number
-
+
110201100112002 = 2340127945770773
BaseRepresentation
bin11001000011101000110001…
…011011010001000010000010
3112110012010022010212221120110
4121003220301123101002002
5103421013323112041002
61030213404141052150
732132523664334304
oct3103506133210202
9473163263787513
10110201100112002
113212802a092869
1210439865557056
134964bc44b0283
141d2da9418d974
15cb18b4540e6c
hex643a316d1082

110201100112002 has 16 divisors (see below), whose sum is σ = 220402754288640. Its totient is φ = 36733607693232.

The previous prime is 110201100111943. The next prime is 110201100112007. The reversal of 110201100112002 is 200211001102011.

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

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

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

Almost surely, 2110201100112002 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 46172057.

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

Adding to 110201100112002 its reverse (200211001102011), we get a palindrome (310412101214013).

Subtracting 110201100112002 from its reverse (200211001102011), we obtain a palindrome (90009900990009).

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

Divisors: 1 2 3 6 401279 802558 1203837 2407674 45770773 91541546 137312319 274624638 18366850018667 36733700037334 55100550056001 110201100112002