Search a number
-
+
201011011131 = 3710194771811
BaseRepresentation
bin1011101100110100110…
…0001001111000111011
3201012211210200101001010
42323031030021320323
511243132304324011
6232202043325003
720344145255220
oct2731514117073
9635753611033
10201011011131
1178280525897
1232b5a220763
1315c55913208
149a2c497947
1553670cd1a6
hex2ecd309e3b

201011011131 has 16 divisors (see below), whose sum is σ = 309335194368. Its totient is φ = 113726172000.

The previous prime is 201011011127. The next prime is 201011011139. The reversal of 201011011131 is 131110110102.

It is not a de Polignac number, because 201011011131 - 22 = 201011011127 is a prime.

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

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

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

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

Almost surely, 2201011011131 is an apocalyptic number.

201011011131 is a gapful number since it is divisible by the number (21) formed by its first and last digit.

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

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

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

The sum of its prime factors is 94771922.

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

Adding to 201011011131 its reverse (131110110102), we get a palindrome (332121121233).

The spelling of 201011011131 in words is "two hundred one billion, eleven million, eleven thousand, one hundred thirty-one".

Divisors: 1 3 7 21 101 303 707 2121 94771811 284315433 663402677 1990208031 9571952911 28715858733 67003670377 201011011131