Search a number
-
+
200010101113 = 1910526847427
BaseRepresentation
bin1011101001000110000…
…1111111000101111001
3201010021001021212121201
42322101201333011321
511234110041213423
6231514450334201
720310302544214
oct2722141770571
9633231255551
10200010101113
1177907540329
123291ab8a361
1315b26447a74
14997559077b
1553092bc2ad
hex2e9187f179

200010101113 has 4 divisors (see below), whose sum is σ = 210536948560. Its totient is φ = 189483253668.

The previous prime is 200010101101. The next prime is 200010101141. The reversal of 200010101113 is 311101010002.

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 200010101113 - 213 = 200010092921 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 200010101113.

It is not an unprimeable number, because it can be changed into a prime (200010101183) 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, 5263423695 + ... + 5263423732.

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

Almost surely, 2200010101113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10526847446.

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

Adding to 200010101113 its reverse (311101010002), we get a palindrome (511111111115).

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

Divisors: 1 19 10526847427 200010101113