Search a number
-
+
102101212110 = 2353403373737
BaseRepresentation
bin101111100010110110…
…1001101101111001110
3100202112121102222101110
41133011231031233032
53133100402241420
6114523223152450
710243106661222
oct1370555155716
9322477388343
10102101212110
113a334521937
12179555a5726
139821c33211
144d28144782
1529c8940ee0
hex17c5b4dbce

102101212110 has 16 divisors (see below), whose sum is σ = 245042909136. Its totient is φ = 27226989888.

The previous prime is 102101212069. The next prime is 102101212183. The reversal of 102101212110 is 11212101201.

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1701686839 + ... + 1701686898.

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

Almost surely, 2102101212110 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 3403373747.

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

Adding to 102101212110 its reverse (11212101201), we get a palindrome (113313313311).

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

Divisors: 1 2 3 5 6 10 15 30 3403373737 6806747474 10210121211 17016868685 20420242422 34033737370 51050606055 102101212110