Search a number
-
+
102110110700 = 22521317291071489
BaseRepresentation
bin101111100011000111…
…1001010001111101100
3100202120020012001221212
41133012033022033230
53133110142020300
6114524142013552
710243245422513
oct1370617121754
9322506161855
10102110110700
113a33954a544
12179585772b8
139823a2a660
144d293bd67a
1529c95ec935
hex17c63ca3ec

102110110700 has 288 divisors, whose sum is σ = 263992478400. Its totient is φ = 33917829120.

The previous prime is 102110110699. The next prime is 102110110721. The reversal of 102110110700 is 7011011201.

It is an unprimeable number.

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

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

Almost surely, 2102110110700 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 102110110700 its reverse (7011011201), we get a palindrome (109121121901).

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