Search a number
-
+
110200001100000 = 25355752476191
BaseRepresentation
bin11001000011100111101111…
…111010110111100011100000
3112110012000110112220100112020
4121003213233322313203200
5103421004100240200000
61030213103121301440
732132454521024550
oct3103475772674340
9473160415810466
10110200001100000
1132127615792889
12104395b9494880
134964a7a8b7206
141d2d9cc22b160
15cb184cd02ba0
hex6439efeb78e0

110200001100000 has 288 divisors, whose sum is σ = 413223563999232. Its totient is φ = 25188571200000.

The previous prime is 110200001099933. The next prime is 110200001100037. The reversal of 110200001100000 is 1100002011.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24138096 + ... + 28338095.

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

Almost surely, 2110200001100000 is an apocalyptic number.

110200001100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

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

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

110200001100000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 110200001100000 its reverse (1100002011), we get a palindrome (110201101102011).

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