Search a number
-
+
101311111013 = 714473015859
BaseRepresentation
bin101111001011010011…
…1001101111101100101
3100200111112201200102212
41132112213031331211
53124441121023023
6114313000413205
710214404143410
oct1362647157545
9320445650385
10101311111013
1139a69532222
1217774a77205
139727337b88
144c91234b77
15297e3c1e78
hex17969cdf65

101311111013 has 4 divisors (see below), whose sum is σ = 115784126880. Its totient is φ = 86838095148.

The previous prime is 101311110997. The next prime is 101311111019. The reversal of 101311111013 is 310111113101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 101311111013 - 24 = 101311110997 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101311111019) 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 3 ways as a sum of consecutive naturals, for example, 7236507923 + ... + 7236507936.

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

Almost surely, 2101311111013 is an apocalyptic number.

It is an amenable number.

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

101311111013 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 14473015866.

The product of its (nonzero) digits is 9, while the sum is 14.

Adding to 101311111013 its reverse (310111113101), we get a palindrome (411422224114).

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

Divisors: 1 7 14473015859 101311111013