Search a number
-
+
101201020111102 = 2173196016148113
BaseRepresentation
bin10111000000101010110010…
…110110101100100011111110
3111021022201112002112122121211
4113000222302312230203332
5101231034142122023402
6555123035023515034
730213350422510162
oct2700526266544376
9437281462478554
10101201020111102
112a27812560289a
12b425528a58a7a
1344612a4b8c992
141adc226a00ca2
15ba770dd104d7
hex5c0ab2dac8fe

101201020111102 has 16 divisors (see below), whose sum is σ = 165915903940992. Its totient is φ = 46087751093760.

The previous prime is 101201020111069. The next prime is 101201020111109. The reversal of 101201020111102 is 201111020102101.

It is a happy number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101201020111109) by changing a digit.

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

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

Almost surely, 2101201020111102 is an apocalyptic number.

101201020111102 is a deficient number, since it is larger than the sum of its proper divisors (64714883829890).

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

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

The sum of its prime factors is 96016148163.

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

Adding to 101201020111102 its reverse (201111020102101), we get a palindrome (302312040213203).

Subtracting 101201020111102 from its reverse (201111020102101), we obtain a palindrome (99909999990999).

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

Divisors: 1 2 17 31 34 62 527 1054 96016148113 192032296226 1632274517921 2976500591503 3264549035842 5953001183006 50600510055551 101201020111102