Search a number
-
+
200110002001 = 7132199011011
BaseRepresentation
bin1011101001011101111…
…1000100111101010001
3201010112000021100212121
42322113133010331101
511234311130031001
6231532415454241
720312624644360
oct2722737047521
9633460240777
10200110002001
1177958974348
1232948527381
1315b41055410
1499849577d7
155312e526a1
hex2e977c4f51

200110002001 has 8 divisors (see below), whose sum is σ = 246289233344. Its totient is φ = 158328792720.

The previous prime is 200110001981. The next prime is 200110002019. The reversal of 200110002001 is 100200011002.

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

It is not a de Polignac number, because 200110002001 - 25 = 200110001969 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1099505415 + ... + 1099505596.

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

Almost surely, 2200110002001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2199011031.

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

Adding to 200110002001 its reverse (100200011002), we get a palindrome (300310013003).

Subtracting from 200110002001 its reverse (100200011002), we obtain a palindrome (99909990999).

The spelling of 200110002001 in words is "two hundred billion, one hundred ten million, two thousand, one".

Divisors: 1 7 13 91 2199011011 15393077077 28587143143 200110002001