Search a number
-
+
11504375051 = 13884951927
BaseRepresentation
bin10101011011011011…
…01101010100001011
31002200202111210201212
422231231231110023
5142030110000201
65141322403335
7555042401021
oct125555552413
932622453655
1011504375051
114973a13284
12229096054b
131114581c20
147b1c84711
15474ebdabb
hex2adb6d50b

11504375051 has 4 divisors (see below), whose sum is σ = 12389326992. Its totient is φ = 10619423112.

The previous prime is 11504375041. The next prime is 11504375053. The reversal of 11504375051 is 15057340511.

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

It is a cyclic number.

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

It is a Duffinian number.

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

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

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

Almost surely, 211504375051 is an apocalyptic number.

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

11504375051 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 884951940.

The product of its (nonzero) digits is 10500, while the sum is 32.

The spelling of 11504375051 in words is "eleven billion, five hundred four million, three hundred seventy-five thousand, fifty-one".

Divisors: 1 13 884951927 11504375051