Search a number
-
+
110200023000 = 23325337597179
BaseRepresentation
bin110011010100001101…
…1101110011111011000
3101112110000210012100100
41212220123232133120
53301142201214000
6122343012535400
710650600511614
oct1465033563730
9345400705310
10110200023000
1142810049381
1219435921560
13a512a91802
1454959b0344
152cee958a00
hex19a86ee7d8

110200023000 has 768 divisors, whose sum is σ = 399499776000. Its totient is φ = 27361152000.

The previous prime is 110200022993. The next prime is 110200023103. The reversal of 110200023000 is 320002011.

It is a happy number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 1394936961 + ... + 1394937039.

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

Almost surely, 2110200023000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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

Adding to 110200023000 its reverse (320002011), we get a palindrome (110520025011).

The spelling of 110200023000 in words is "one hundred ten billion, two hundred million, twenty-three thousand".