Search a number
-
+
111200011002 = 2361929971427
BaseRepresentation
bin110011110010000001…
…0011000001011111010
3101122000201102212000000
41213210002120023322
53310214200323002
6123030134053430
711014432332543
oct1474402301372
9348021385000
10111200011002
1143183564143
12196747aa276
13a641cc63a2
14554c7174ca
152d5c63661c
hex19e40982fa

111200011002 has 224 divisors, whose sum is σ = 275325825600. Its totient is φ = 33531853824.

The previous prime is 111200010997. The next prime is 111200011033. The reversal of 111200011002 is 200110002111.

It is a happy number.

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

It is an unprimeable number.

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 111 ways as a sum of consecutive naturals, for example, 77925013 + ... + 77926439.

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

Almost surely, 2111200011002 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 111200011002 its reverse (200110002111), we get a palindrome (311310013113).

The spelling of 111200011002 in words is "one hundred eleven billion, two hundred million, eleven thousand, two".