Search a number
-
+
51100605050091 = 3172813565738961
BaseRepresentation
bin10111001111001110010010…
…11010010110110011101011
320200221011121000201202120020
423213213021122112303223
523144213014343100331
6300403143251131523
713522616426120112
oct1347471132266353
9220834530652506
1051100605050091
11153117103a7183
1258937812a3ba3
1322689c697464c
14c893d51b0c79
155d939d7c9c96
hex2e79c9696ceb

51100605050091 has 16 divisors (see below), whose sum is σ = 72398763884448. Its totient is φ = 31949021081600.

The previous prime is 51100605050071. The next prime is 51100605050141. The reversal of 51100605050091 is 19005050600115.

It is a cyclic number.

It is not a de Polignac number, because 51100605050091 - 29 = 51100605049579 is a prime.

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

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

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

Almost surely, 251100605050091 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 3565739262.

The product of its (nonzero) digits is 6750, while the sum is 33.

The spelling of 51100605050091 in words is "fifty-one trillion, one hundred billion, six hundred five million, fifty thousand, ninety-one".

Divisors: 1 3 17 51 281 843 4777 14331 3565738961 10697216883 60617562337 181852687011 1001972648041 3005917944123 17033535016697 51100605050091