Search a number
-
+
50511051050005 = 5713111013299011
BaseRepresentation
bin10110111110000100001010…
…10000010100110000010101
320121211210211222212111001201
423133002011100110300111
523110033113032100010
6255232242334552501
713432205634603250
oct1337020520246025
9217753758774051
1050511051050005
1115104686551a67
1257b9468968731
1322252302306a0
14c68a683ca097
155c8d95a6823a
hex2df085414c15

50511051050005 has 16 divisors (see below), whose sum is σ = 74600936936064. Its totient is φ = 31971830114880.

The previous prime is 50511051049997. The next prime is 50511051050029. The reversal of 50511051050005 is 50005015011505.

It is not a de Polignac number, because 50511051050005 - 23 = 50511051049997 is a prime.

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

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 15 ways as a sum of consecutive naturals, for example, 55506649051 + ... + 55506649960.

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

Almost surely, 250511051050005 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 111013299036.

The product of its (nonzero) digits is 3125, while the sum is 28.

The spelling of 50511051050005 in words is "fifty trillion, five hundred eleven billion, fifty-one million, fifty thousand, five".

Divisors: 1 5 7 13 35 65 91 455 111013299011 555066495055 777093093077 1443172887143 3885465465385 7215864435715 10102210210001 50511051050005