Base | Representation |
---|---|
bin | 1110100011100001111… |
… | …00000101010110000001 |
3 | 1202210212121002100112221 |
4 | 13101300330011112001 |
5 | 31143211404130212 |
6 | 1021425310251041 |
7 | 51063134255266 |
oct | 7216074052601 |
9 | 1683777070487 |
10 | 500111005057 |
11 | 183106696214 |
12 | 80b121b6a81 |
13 | 38211145741 |
14 | 1a2c3c7b26d |
15 | d02075d807 |
hex | 7470f05581 |
500111005057 has 8 divisors (see below), whose sum is σ = 500785729920. Its totient is φ = 499436469120.
The previous prime is 500111005039. The next prime is 500111005099. The reversal of 500111005057 is 750500111005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 500111005057 - 227 = 499976787329 is a prime.
It is a super-2 number, since 2×5001110050572 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (500111605057) 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 7 ways as a sum of consecutive naturals, for example, 5721393 + ... + 5808145.
It is an arithmetic number, because the mean of its divisors is an integer number (62598216240).
Almost surely, 2500111005057 is an apocalyptic number.
It is an amenable number.
500111005057 is a deficient number, since it is larger than the sum of its proper divisors (674724863).
500111005057 is an equidigital number, since it uses as much as digits as its factorization.
500111005057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94463.
The product of its (nonzero) digits is 875, while the sum is 25.
The spelling of 500111005057 in words is "five hundred billion, one hundred eleven million, five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.327 sec. • engine limits •