Search a number
-
+
110200102000 = 24533179149151
BaseRepresentation
bin110011010100001110…
…0000001110001110000
3101112110000221012201021
41212220130001301300
53301142211231000
6122343014345224
710650601261132
oct1465034016160
9345400835637
10110200102000
11428100a276a
121943595b214
13a512abb761
1454959d1052
152cee97211a
hex19a8701c70

110200102000 has 320 divisors, whose sum is σ = 282267648000. Its totient is φ = 41558400000.

The previous prime is 110200101953. The next prime is 110200102013. The reversal of 110200102000 is 201002011.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 729801925 + ... + 729802075.

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

Almost surely, 2110200102000 is an apocalyptic number.

110200102000 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 110200102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (141133824000).

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

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

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

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

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

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

Adding to 110200102000 its reverse (201002011), we get a palindrome (110401104011).

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