Search a number
-
+
101311020111 = 3721036691171
BaseRepresentation
bin101111001011010011…
…0110111110001001111
3100200111112120001202010
41132112212313301033
53124441110120421
6114312554432303
710214403314400
oct1362646676117
9320445501663
10101311020111
1139a6947a9a4
1217774a32693
1397273056a2
144c9120d9a7
15297e3a5076
hex17969b7c4f

101311020111 has 24 divisors (see below), whose sum is σ = 158661070464. Its totient is φ = 57329944560.

The previous prime is 101311020101. The next prime is 101311020119. The reversal of 101311020111 is 111020113101.

It is not a de Polignac number, because 101311020111 - 27 = 101311019983 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3330445 + ... + 3360726.

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

Almost surely, 2101311020111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6691291 (or 6691284 counting only the distinct ones).

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

Adding to 101311020111 its reverse (111020113101), we get a palindrome (212331133212).

The spelling of 101311020111 in words is "one hundred one billion, three hundred eleven million, twenty thousand, one hundred eleven".

Divisors: 1 3 7 21 49 103 147 309 721 2163 5047 15141 6691171 20073513 46838197 140514591 327867379 689190613 983602137 2067571839 4824334291 14473002873 33770340037 101311020111