Search a number
-
+
101020112121111 = 31997112363150067
BaseRepresentation
bin10110111110000010010011…
…111001011110110100010111
3111020200102120022020120021020
4112332002103321132310113
5101220103142200333421
6554503555425452223
730164314360123011
oct2676022371366427
9436612508216236
10101020112121111
112a208430781367
12b3b645b1a1073
13444a2040b5061
141ad35843a91b1
15ba2b71a4cdc6
hex5be093e5ed17

101020112121111 has 16 divisors (see below), whose sum is σ = 134763028089984. Its totient is φ = 67311969840864.

The previous prime is 101020112121083. The next prime is 101020112121119. The reversal of 101020112121111 is 111121211020101.

It is a de Polignac number, because none of the positive numbers 2k-101020112121111 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 673091700 + ... + 673241766.

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

Almost surely, 2101020112121111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 264430.

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

Adding to 101020112121111 its reverse (111121211020101), we get a palindrome (212141323141212).

The spelling of 101020112121111 in words is "one hundred one trillion, twenty billion, one hundred twelve million, one hundred twenty-one thousand, one hundred eleven".

Divisors: 1 3 1997 5991 112363 150067 337089 450201 224388911 299683799 673166733 899051397 16861978321 50585934963 33673370707037 101020112121111