Search a number
-
+
20001301111 = 111818300101
BaseRepresentation
bin10010101000001010…
…111010001001110111
31220121220222101001001
4102220022322021313
5311430313113421
613104413144131
71305436153141
oct225012721167
956556871031
1020001301111
118534238620
123a6248b047
131b69a41c1c
14d7a543c91
157c0e26691
hex4a82ba277

20001301111 has 4 divisors (see below), whose sum is σ = 21819601224. Its totient is φ = 18183001000.

The previous prime is 20001301109. The next prime is 20001301181. The reversal of 20001301111 is 11110310002.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 20001301111 - 21 = 20001301109 is a prime.

It is a super-2 number, since 2×200013011112 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 220001301111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1818300112.

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

Adding to 20001301111 its reverse (11110310002), we get a palindrome (31111611113).

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

Divisors: 1 11 1818300101 20001301111