Search a number
-
+
201010111022 = 2714357865073
BaseRepresentation
bin1011101100110100100…
…0101110001000101110
3201012211201222122022202
42323031020232020232
511243132042023042
6232202012141502
720344134516050
oct2731510561056
9635751878282
10201010111022
117827aa705a6
1232b59a67892
1315c556895c6
149a2c3018d0
155366ea1632
hex2ecd22e22e

201010111022 has 8 divisors (see below), whose sum is σ = 344588761776. Its totient is φ = 86147190432.

The previous prime is 201010111007. The next prime is 201010111033. The reversal of 201010111022 is 220111010102.

201010111022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a congruent number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 7178932523 + ... + 7178932550.

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

Almost surely, 2201010111022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 14357865082.

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

Adding to 201010111022 its reverse (220111010102), we get a palindrome (421121121124).

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

Divisors: 1 2 7 14 14357865073 28715730146 100505055511 201010111022