Search a number
-
+
51051000110611 = 2923116312013207
BaseRepresentation
bin10111001101110001111001…
…01110100001111000010011
320200202102112222021202002111
423212320330232201320103
523142404422012014421
6300324301121130151
713516212242104234
oct1346707456417023
9220672488252074
1051051000110611
11152a2675735a26
125886038789957
13226411ca06b57
14c86c4b11b08b
155d7e4896eee1
hex2e6e3cba1e13

51051000110611 has 24 divisors (see below), whose sum is σ = 54912469873664. Its totient is φ = 47407955101920.

The previous prime is 51051000110609. The next prime is 51051000110629. The reversal of 51051000110611 is 11601100015015.

It is not a de Polignac number, because 51051000110611 - 21 = 51051000110609 is a prime.

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

It is a Duffinian number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1757031 + ... + 10256176.

Almost surely, 251051000110611 is an apocalyptic number.

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

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

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

The sum of its prime factors is 12013459 (or 12013430 counting only the distinct ones).

The product of its (nonzero) digits is 150, while the sum is 22.

Adding to 51051000110611 its reverse (11601100015015), we get a palindrome (62652100125626).

The spelling of 51051000110611 in words is "fifty-one trillion, fifty-one billion, one hundred ten thousand, six hundred eleven".

Divisors: 1 29 31 163 841 899 4727 5053 26071 137083 146537 4249573 12013207 348383003 372409417 1958152741 10103107087 10799873093 56786429489 60702734971 313196319697 1646806455181 1760379314159 51051000110611