Search a number
-
+
500005066161 = 3473546135221
BaseRepresentation
bin1110100011010101001…
…11111101010110110001
31202210121012202002201010
413101222213331112301
531143002244104121
61021411003501133
751060406636446
oct7215247752661
91683535662633
10500005066161
11183061908807
1280aa28277a9
13381c52029c3
141a2b3b819cd
15d0162d4376
hex746a9fd5b1

500005066161 has 8 divisors (see below), whose sum is σ = 680857962624. Its totient is φ = 326244440240.

The previous prime is 500005066153. The next prime is 500005066163. The reversal of 500005066161 is 161660500005.

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 500005066161 - 23 = 500005066153 is a prime.

It is a Curzon number.

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

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

Almost surely, 2500005066161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3546135271.

The product of its (nonzero) digits is 5400, while the sum is 30.

Adding to 500005066161 its reverse (161660500005), we get a palindrome (661665566166).

The spelling of 500005066161 in words is "five hundred billion, five million, sixty-six thousand, one hundred sixty-one".

Divisors: 1 3 47 141 3546135221 10638405663 166668355387 500005066161