Search a number
-
+
102011011100202 = 23147859114986813
BaseRepresentation
bin10111001100011101001010…
…000101000110111000101010
3111101012011020202111020002210
4113030131022011012320222
5101332322022320201302
61000543113405505550
730326023644354261
oct2714351205067052
9441164222436083
10102011011100202
112a55a699387576
12b5365012722b6
1344bc79b9c0209
141b29505c215d8
15bbd8192d066c
hex5cc74a146e2a

102011011100202 has 16 divisors (see below), whose sum is σ = 204023403816480. Its totient is φ = 34003440097392.

The previous prime is 102011011100177. The next prime is 102011011100231. The reversal of 102011011100202 is 202001110110201.

It is an unprimeable number.

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

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

Almost surely, 2102011011100202 is an apocalyptic number.

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

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

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

102011011100202 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 115134677.

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

Adding to 102011011100202 its reverse (202001110110201), we get a palindrome (304012121210403).

Subtracting 102011011100202 from its reverse (202001110110201), we obtain a palindrome (99990099009999).

The spelling of 102011011100202 in words is "one hundred two trillion, eleven billion, eleven million, one hundred thousand, two hundred two".

Divisors: 1 2 3 6 147859 295718 443577 887154 114986813 229973626 344960439 689920878 17001835183367 34003670366734 51005505550101 102011011100202