Search a number
-
+
500050500001 = 13231672409699
BaseRepresentation
bin1110100011011010101…
…01010001100110100001
31202210201101020101012221
413101231111101212201
531143100412000001
61021415305351041
751061501055563
oct7215525214641
91683641211187
10500050500001
1118308551a938
1280ab5a98481
133820174c930
141a2b9c0b333
15d01a2ab1a1
hex746d5519a1

500050500001 has 8 divisors (see below), whose sum is σ = 561929659200. Its totient is φ = 441516160272.

The previous prime is 500050499953. The next prime is 500050500007. The reversal of 500050500001 is 100005050005.

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 500050500001 - 29 = 500050499489 is a prime.

It is not an unprimeable number, because it can be changed into a prime (500050500007) 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 7 ways as a sum of consecutive naturals, for example, 836204551 + ... + 836205148.

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

Almost surely, 2500050500001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1672409735.

The product of its (nonzero) digits is 125, while the sum is 16.

Adding to 500050500001 its reverse (100005050005), we get a palindrome (600055550006).

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

Divisors: 1 13 23 299 1672409699 21741326087 38465423077 500050500001