Search a number
-
+
101111020111102 = 2593532427402413
BaseRepresentation
bin10110111111010110111110…
…011011111100010011111110
3111021000010012211122221111111
4112333112332123330103332
5101223100332122023402
6555013432243312234
730204013223233501
oct2677267633742376
9437003184587444
10101111020111102
112a242a40991801
12b40bbb007b67a
13445596106a701
141ad7b29b03138
15ba51e29839d7
hex5bf5be6fc4fe

101111020111102 has 16 divisors (see below), whose sum is σ = 154674081820080. Its totient is φ = 49557847643392.

The previous prime is 101111020111099. The next prime is 101111020111111. The reversal of 101111020111102 is 201111020111101.

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

It is a congruent number.

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, 1213659553 + ... + 1213742860.

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

Almost surely, 2101111020111102 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2427402827.

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

Adding to 101111020111102 its reverse (201111020111101), we get a palindrome (302222040222203).

Subtracting 101111020111102 from its reverse (201111020111101), we obtain a palindrome (99999999999999).

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

Divisors: 1 2 59 118 353 706 20827 41654 2427402413 4854804826 143216742367 286433484734 856873051789 1713746103578 50555510055551 101111020111102