Search a number
-
+
20010011011 = 597111294231
BaseRepresentation
bin10010101000101100…
…001000100110000011
31220122112100212202221
4102220230020212003
5311440030323021
613105323551511
71305603200344
oct225054104603
956575325687
1020010011011
118539147491
123a6538b597
131b6b7a1503
14d7b7700cb
157c1a97241
hex4a8b08983

20010011011 has 16 divisors (see below), whose sum is σ = 20658931200. Its totient is φ = 19372046400.

The previous prime is 20010010961. The next prime is 20010011059. The reversal of 20010011011 is 11011001002.

It is a cyclic number.

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

It is a Duffinian number.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4727266 + ... + 4731496.

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

Almost surely, 220010011011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5490.

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 20010011011 its reverse (11011001002), we get a palindrome (31021012013).

The spelling of 20010011011 in words is "twenty billion, ten million, eleven thousand, eleven".

Divisors: 1 59 71 1129 4189 4231 66611 80159 249629 300401 4729381 4776799 17723659 281831141 339152729 20010011011