Search a number
-
+
200110010103 = 3223993031153
BaseRepresentation
bin1011101001011101111…
…1000110111011110111
3201010112000021202222200
42322113133012323313
511234311130310403
6231532415555543
720312625010113
oct2722737067367
9633460252880
10200110010103
117795897a443
123294852bbb3
1315b41059003
14998495a743
155312e54ca3
hex2e977c6ef7

200110010103 has 12 divisors (see below), whose sum is σ = 290257200480. Its totient is φ = 132848485056.

The previous prime is 200110010057. The next prime is 200110010147. The reversal of 200110010103 is 301010011002.

It is not a de Polignac number, because 200110010103 - 29 = 200110009591 is a prime.

It is a super-2 number, since 2×2001100101032 (a number of 23 digits) contains 22 as substring.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 46513426 + ... + 46517727.

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

Almost surely, 2200110010103 is an apocalyptic number.

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

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

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

The sum of its prime factors is 93031398 (or 93031395 counting only the distinct ones).

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

Adding to 200110010103 its reverse (301010011002), we get a palindrome (501120021105).

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

Divisors: 1 3 9 239 717 2151 93031153 279093459 837280377 22234445567 66703336701 200110010103