Search a number
-
+
20110203223 = 1131101583903
BaseRepresentation
bin10010101110101010…
…010101100101010111
31220220111220011122121
4102232222111211113
5312141203000343
613123303240411
71311230623045
oct225652254527
956814804577
1020110203223
11858a75a370
123a92a49107
131b86481646
14d8abb1395
157ca788aed
hex4aea95957

20110203223 has 16 divisors (see below), whose sum is σ = 22870351872. Its totient is φ = 17517060000.

The previous prime is 20110203199. The next prime is 20110203233. The reversal of 20110203223 is 32230201102.

It is not a de Polignac number, because 20110203223 - 213 = 20110195031 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 20110203197 and 20110203206.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 257511 + ... + 326392.

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

Almost surely, 220110203223 is an apocalyptic number.

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

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

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

The sum of its prime factors is 584046.

The product of its (nonzero) digits is 144, while the sum is 16.

Adding to 20110203223 its reverse (32230201102), we get a palindrome (52340404325).

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

Divisors: 1 11 31 101 341 1111 3131 34441 583903 6422933 18100993 58974203 199110923 648716233 1828200293 20110203223