Search a number
-
+
505051056057 = 3168350352019
BaseRepresentation
bin1110101100101110110…
…00111000011110111001
31210021121212122221112210
413112113120320132321
531233321032243212
61024003420525333
751326431100322
oct7262730703671
91707555587483
10505051056057
11185211177699
1281a706b0849
133881a744642
141a631db5449
15d20e2c253c
hex75976387b9

505051056057 has 4 divisors (see below), whose sum is σ = 673401408080. Its totient is φ = 336700704036.

The previous prime is 505051056031. The next prime is 505051056061. The reversal of 505051056057 is 750650150505.

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 de Polignac number, because none of the positive numbers 2k-505051056057 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 2505051056057 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 168350352022.

The product of its (nonzero) digits is 131250, while the sum is 39.

The spelling of 505051056057 in words is "five hundred five billion, fifty-one million, fifty-six thousand, fifty-seven".

Divisors: 1 3 168350352019 505051056057