Search a number
-
+
100030131111 = 3197169255721
BaseRepresentation
bin101110100101001000…
…0101010101110100111
3100120012021100011100210
41131022100222232213
53114330203143421
6113541520510503
710140561041211
oct1351220525647
9316167304323
10100030131111
1139471446049
1217477a7b433
139581b2c2c1
144bad0655b1
152906bdc576
hex174a42aba7

100030131111 has 8 divisors (see below), whose sum is σ = 134050531824. Its totient is φ = 66348242240.

The previous prime is 100030131053. The next prime is 100030131121. The reversal of 100030131111 is 111131030001.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 100030131111 - 217 = 100030000039 is a prime.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84627270 + ... + 84628451.

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

Almost surely, 2100030131111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 169255921.

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

Adding to 100030131111 its reverse (111131030001), we get a palindrome (211161161112).

The spelling of 100030131111 in words is "one hundred billion, thirty million, one hundred thirty-one thousand, one hundred eleven".

Divisors: 1 3 197 591 169255721 507767163 33343377037 100030131111