Search a number
-
+
20110310201 = 192630940231
BaseRepresentation
bin10010101110101010…
…101111101100111001
31220220112002121101202
4102232222233230321
5312141214411301
613123305423545
71311231546662
oct225652575471
956815077352
1020110310201
11858a822783
123a92a9abb5
131b864bb247
14d8abdc369
157ca7aa66b
hex4aeaafb39

20110310201 has 8 divisors (see below), whose sum is σ = 21170078400. Its totient is φ = 19050675120.

The previous prime is 20110310177. The next prime is 20110310251. The reversal of 20110310201 is 10201301102.

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 20110310201 - 226 = 20043201337 is a prime.

It is a Duffinian number.

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

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

Almost surely, 220110310201 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 66559.

The product of its (nonzero) digits is 12, while the sum is 11.

Adding to 20110310201 its reverse (10201301102), we get a palindrome (30311611303).

Subtracting from 20110310201 its reverse (10201301102), we obtain a palindrome (9909009099).

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

Divisors: 1 19 26309 40231 499871 764389 1058437379 20110310201