Search a number
-
+
51100201113 = 3132639949633
BaseRepresentation
bin101111100101110011…
…110011000010011001
311212220021001011211020
4233211303303002121
51314123122413423
635250342353053
73456211354113
oct574563630231
9155807034736
1051100201113
111a742805475
129aa142b789
134a849910c0
14268a8c23b3
1514e126a4e3
hexbe5cf3099

51100201113 has 16 divisors (see below), whose sum is σ = 73378905600. Its totient is φ = 31444452864.

The previous prime is 51100201099. The next prime is 51100201121. The reversal of 51100201113 is 31110200115.

It is not a de Polignac number, because 51100201113 - 26 = 51100201049 is a prime.

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

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

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

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

Almost surely, 251100201113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 76048.

The product of its (nonzero) digits is 30, while the sum is 15.

Adding to 51100201113 its reverse (31110200115), we get a palindrome (82210401228).

The spelling of 51100201113 in words is "fifty-one billion, one hundred million, two hundred one thousand, one hundred thirteen".

Divisors: 1 3 13 39 26399 49633 79197 148899 343187 645229 1029561 1935687 1310261567 3930784701 17033400371 51100201113