Search a number
-
+
500056101101 = 3121907272863
BaseRepresentation
bin1110100011011011010…
…10101001000011101101
31202210201202202221111002
413101231222221003231
531143103330213401
61021420025410045
751061566504404
oct7215552510355
91683652687432
10500056101101
111830886a6047
1280ab7939925
13382029611ab
141a2ba86863b
15d01aa15a6b
hex746daa90ed

500056101101 has 12 divisors (see below), whose sum is σ = 516980140416. Its totient is φ = 483669723960.

The previous prime is 500056101031. The next prime is 500056101113. The reversal of 500056101101 is 101101650005.

It is a de Polignac number, because none of the positive numbers 2k-500056101101 is a prime.

It is a super-2 number, since 2×5000561011012 (a number of 24 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1696196 + ... + 1969058.

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

Almost surely, 2500056101101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 274832 (or 274801 counting only the distinct ones).

The product of its (nonzero) digits is 150, while the sum is 20.

Adding to 500056101101 its reverse (101101650005), we get a palindrome (601157751106).

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

Divisors: 1 31 961 1907 59117 272863 1832627 8458753 262221343 520349741 16130841971 500056101101