Search a number
-
+
20002011311 = 20119946301
BaseRepresentation
bin10010101000001101…
…100111100010101111
31220121222022110020202
4102220031213202233
5311431003330221
613104440304115
71305445201532
oct225015474257
956558273222
1020002011311
118534683167
123a6277203b
131b69c30269
14d7a68aa19
157c1016d0b
hex4a83678af

20002011311 has 4 divisors (see below), whose sum is σ = 20011959624. Its totient is φ = 19992063000.

The previous prime is 20002011287. The next prime is 20002011329. The reversal of 20002011311 is 11311020002.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-20002011311 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

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

Almost surely, 220002011311 is an apocalyptic number.

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

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

20002011311 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 9948312.

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

Adding to 20002011311 its reverse (11311020002), we get a palindrome (31313031313).

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

Divisors: 1 2011 9946301 20002011311