Search a number
-
+
102000100110 = 23531233470719
BaseRepresentation
bin101111011111110101…
…1100000001100001110
3100202021120011221210120
41132333223200030032
53132344011200420
6114505212045410
710240441355106
oct1367753401416
9322246157716
10102000100110
113a2924409a7
1217927763866
139806cc052c
144d18944206
1529beb1bd40
hex17bfae030e

102000100110 has 64 divisors (see below), whose sum is σ = 253782097920. Its totient is φ = 26209578240.

The previous prime is 102000100039. The next prime is 102000100121. The reversal of 102000100110 is 11001000201.

102000100110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a super-3 number, since 3×1020001001103 (a number of 34 digits) contains 333 as substring.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18670 + ... + 452049.

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

Almost surely, 2102000100110 is an apocalyptic number.

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

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

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

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

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

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

The sum of its prime factors is 470993.

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

Adding to 102000100110 its reverse (11001000201), we get a palindrome (113001100311).

Subtracting from 102000100110 its reverse (11001000201), we obtain a palindrome (90999099909).

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

Divisors: 1 2 3 5 6 10 15 30 31 62 93 155 186 233 310 465 466 699 930 1165 1398 2330 3495 6990 7223 14446 21669 36115 43338 72230 108345 216690 470719 941438 1412157 2353595 2824314 4707190 7060785 14121570 14592289 29184578 43776867 72961445 87553734 109677527 145922890 218884335 219355054 329032581 437768670 548387635 658065162 1096775270 1645162905 3290325810 3400003337 6800006674 10200010011 17000016685 20400020022 34000033370 51000050055 102000100110