Search a number
-
+
110010102000 = 2435337259227
BaseRepresentation
bin110011001110100011…
…1001111000011110000
3101111221210102012201020
41212131013033003300
53300300041231000
6122312110135440
710643103303231
oct1463507170360
9344853365636
10110010102000
114272291a977
12193a21b1580
13a4b2626016
145478693088
152cdce40ba0
hex199d1cf0f0

110010102000 has 480 divisors, whose sum is σ = 372328669440. Its totient is φ = 27935769600.

The previous prime is 110010101969. The next prime is 110010102067. The reversal of 110010102000 is 201010011.

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 self number, because there is not a number n which added to its sum of digits gives 110010102000.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 484625887 + ... + 484626113.

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

Almost surely, 2110010102000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110010102000 its reverse (201010011), we get a palindrome (110211112011).

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