Search a number
-
+
101001111013 = 119181919183
BaseRepresentation
bin101111000010000100…
…0101010010111100101
3100122200221102001101101
41132010020222113211
53123322241023023
6114222124200101
710203621164335
oct1360410522745
9318627361341
10101001111013
113991a548680
12176a9099031
1396a804851a
144c61dbb0c5
15296208a1ad
hex178422a5e5

101001111013 has 4 divisors (see below), whose sum is σ = 110183030208. Its totient is φ = 91819191820.

The previous prime is 101001111011. The next prime is 101001111037. The reversal of 101001111013 is 310111100101.

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 a cyclic number.

It is not a de Polignac number, because 101001111013 - 21 = 101001111011 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 (101001111011) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4590959581 + ... + 4590959602.

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

Almost surely, 2101001111013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 9181919194.

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 101001111013 its reverse (310111100101), we get a palindrome (411112211114).

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

Divisors: 1 11 9181919183 101001111013