Search a number
-
+
500505550051 = 1338500426927
BaseRepresentation
bin1110100100010000111…
…01001001110011100011
31202211220002111022112111
413102020131021303203
531200013410100201
61021532402540151
751105664660243
oct7221035116343
91684802438474
10500505550051
11183299375761
1281002367657
1338274ac7110
141a320421b23
15d0451e5b51
hex7488749ce3

500505550051 has 4 divisors (see below), whose sum is σ = 539005976992. Its totient is φ = 462005123112.

The previous prime is 500505549991. The next prime is 500505550057. The reversal of 500505550051 is 150055505005.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 500505550051 - 223 = 500497161443 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 500505549995 and 500505550022.

It is not an unprimeable number, because it can be changed into a prime (500505550057) 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, 19250213451 + ... + 19250213476.

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

Almost surely, 2500505550051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 38500426940.

The product of its (nonzero) digits is 15625, while the sum is 31.

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

Divisors: 1 13 38500426927 500505550051