Search a number
-
+
20002011001 = 734774311083
BaseRepresentation
bin10010101000001101…
…100111011101111001
31220121222022102211021
4102220031213131321
5311431003323001
613104440302441
71305445200610
oct225015473571
956558272737
1020002011001
118534682a05
123a62771a21
131b69c3008b
14d7a68a877
157c1016ba1
hex4a8367779

20002011001 has 16 divisors (see below), whose sum is σ = 22958244864. Its totient is φ = 17070624144.

The previous prime is 20002010989. The next prime is 20002011067. The reversal of 20002011001 is 10011020002.

It is not a de Polignac number, because 20002011001 - 25 = 20002010969 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 220002011001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 12180.

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

Adding to 20002011001 its reverse (10011020002), we get a palindrome (30013031003).

Subtracting from 20002011001 its reverse (10011020002), we obtain a palindrome (9990990999).

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

Divisors: 1 7 347 743 2429 5201 11083 77581 257821 1804747 3845801 8234669 26920607 57642683 2857430143 20002011001