Search a number
-
+
516011050057 = 5039102403463
BaseRepresentation
bin1111000001001001010…
…01111100010001001001
31211022220200211022212111
413200210221330101021
531423242312100212
61033015135342321
752165143361516
oct7404451742111
91738820738774
10516011050057
11189925870378
128400b0819a1
13398762a27a9
141ad9183030d
15d6515acea7
hex7824a7c449

516011050057 has 4 divisors (see below), whose sum is σ = 516113458560. Its totient is φ = 515908641556.

The previous prime is 516011050039. The next prime is 516011050067. The reversal of 516011050057 is 750050110615.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 516011050057 - 231 = 513863566409 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51196693 + ... + 51206770.

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

Almost surely, 2516011050057 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 102408502.

The product of its (nonzero) digits is 5250, while the sum is 31.

The spelling of 516011050057 in words is "five hundred sixteen billion, eleven million, fifty thousand, fifty-seven".

Divisors: 1 5039 102403463 516011050057