Search a number
-
+
20002011020 = 2256116395091
BaseRepresentation
bin10010101000001101…
…100111011110001100
31220121222022102211222
4102220031213132030
5311431003323040
613104440302512
71305445200635
oct225015473614
956558272758
1020002011020
118534682a22
123a62771a38
131b69c300a4
14d7a68a88c
157c1016bb5
hex4a836778c

20002011020 has 24 divisors (see below), whose sum is σ = 42692819568. Its totient is φ = 7869643200.

The previous prime is 20002010989. The next prime is 20002011067. The reversal of 20002011020 is 2011020002.

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

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 8196326 + ... + 8198765.

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

Almost surely, 220002011020 is an apocalyptic number.

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

It is an amenable number.

20002011020 is an abundant number, since it is smaller than the sum of its proper divisors (22690808548).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 20002011020 its reverse (2011020002), we get a palindrome (22013031022).

The spelling of 20002011020 in words is "twenty billion, two million, eleven thousand, twenty".

Divisors: 1 2 4 5 10 20 61 122 244 305 610 1220 16395091 32790182 65580364 81975455 163950910 327901820 1000100551 2000201102 4000402204 5000502755 10001005510 20002011020