Search a number
-
+
20031101111 = 716033178481
BaseRepresentation
bin10010101001111100…
…100101100010110111
31220201000001100221202
4102221330211202313
5312010430213421
613111400003115
71306250356460
oct225174454267
956630040852
1020031101111
11854a04181a
123a7046049b
131b72c76b68
14d8049dd67
157c386110b
hex4a9f258b7

20031101111 has 8 divisors (see below), whose sum is σ = 22894243104. Its totient is φ = 17168348160.

The previous prime is 20031101093. The next prime is 20031101161. The reversal of 20031101111 is 11110113002.

It is a happy number.

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 20031101111 - 26 = 20031101047 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 20031101092 and 20031101101.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (20031101161) 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, 22991 + ... + 201471.

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

Almost surely, 220031101111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 194521.

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

Adding to 20031101111 its reverse (11110113002), we get a palindrome (31141214113).

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

Divisors: 1 7 16033 112231 178481 1249367 2861585873 20031101111