Search a number
-
+
200110101001 = 1910532110579
BaseRepresentation
bin1011101001011101111…
…1011101001000001001
3201010112000110101200021
42322113133131020021
511234311141213001
6231532421540441
720312625536116
oct2722737351011
9633460411607
10200110101001
1177958a31768
1232948574721
1315b4108b4b5
14998498190d
155312e71ba1
hex2e977dd209

200110101001 has 4 divisors (see below), whose sum is σ = 210642211600. Its totient is φ = 189577990404.

The previous prime is 200110100977. The next prime is 200110101031. The reversal of 200110101001 is 100101011002.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 200110101001 - 215 = 200110068233 is a prime.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5266055271 + ... + 5266055308.

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

Almost surely, 2200110101001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10532110598.

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

Adding to 200110101001 its reverse (100101011002), we get a palindrome (300211112003).

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

Divisors: 1 19 10532110579 200110101001