Search a number
-
+
500001050057 = 757976596581
BaseRepresentation
bin1110100011010100110…
…00101000110111001001
31202210120221012001122112
413101222120220313021
531143000232100212
61021410341432105
751060330541625
oct7215230506711
91683527161575
10500001050057
1118305a615413
1280aa140b635
13381c4427a02
141a2b3418185
15d015c8e422
hex746a628dc9

500001050057 has 4 divisors (see below), whose sum is σ = 500007722436. Its totient is φ = 499994377680.

The previous prime is 500001050023. The next prime is 500001050063. The reversal of 500001050057 is 750050100005.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 750050100005 = 5150010020001.

It can be written as a sum of positive squares in 2 ways, for example, as 231903886096 + 268097163961 = 481564^2 + 517781^2 .

It is a cyclic number.

It is not a de Polignac number, because 500001050057 - 214 = 500001033673 is a prime.

It is a Duffinian number.

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

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 3 ways as a sum of consecutive naturals, for example, 3222494 + ... + 3374087.

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

Almost surely, 2500001050057 is an apocalyptic number.

It is an amenable number.

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

500001050057 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 6672378.

The product of its (nonzero) digits is 875, while the sum is 23.

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

Divisors: 1 75797 6596581 500001050057