Search a number
-
+
200011002001 = 11231373129719
BaseRepresentation
bin1011101001000110010…
…1011011000010010001
3201010021002222122101221
42322101211123002101
511234110304031001
6231514521525041
720310313315546
oct2722145330221
9633232878357
10200011002001
1177907aa6168
123291b343781
1315b266a1b35
149975746bcd
1553093e91a1
hex2e9195b091

200011002001 has 8 divisors (see below), whose sum is σ = 200336454720. Its totient is φ = 199685813712.

The previous prime is 200011001999. The next prime is 200011002013. The reversal of 200011002001 is 100200110002.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 200011002001 - 21 = 200011001999 is a prime.

It is a Duffinian number.

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

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, 1477020 + ... + 1606738.

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

Almost surely, 2200011002001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 132215.

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

Adding to 200011002001 its reverse (100200110002), we get a palindrome (300211112003).

The spelling of 200011002001 in words is "two hundred billion, eleven million, two thousand, one".

Divisors: 1 1123 1373 129719 1541879 145674437 178104187 200011002001