Search a number
-
+
20000301111 = 337105821699
BaseRepresentation
bin10010101000000111…
…000110000000110111
31220121212002120022000
4102220013012000313
5311430034113421
613104335510343
71305424516530
oct225007060067
956555076260
1020000301111
11853371527a
123a620883b3
131b697819cb
14d7a363687
157c0cca226
hex4a81c6037

20000301111 has 16 divisors (see below), whose sum is σ = 33862944000. Its totient is φ = 11428743384.

The previous prime is 20000301103. The next prime is 20000301131. The reversal of 20000301111 is 11110300002.

It is not a de Polignac number, because 20000301111 - 23 = 20000301103 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a congruent number.

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

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

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

Almost surely, 220000301111 is an apocalyptic number.

20000301111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.

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

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

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

The sum of its prime factors is 105821715 (or 105821709 counting only the distinct ones).

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

Adding to 20000301111 its reverse (11110300002), we get a palindrome (31110601113).

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

Divisors: 1 3 7 9 21 27 63 189 105821699 317465097 740751893 952395291 2222255679 2857185873 6666767037 20000301111