Search a number
-
+
11506000051 = 713457276673
BaseRepresentation
bin10101011011100111…
…11010000010110011
31002200212120100211001
422231303322002303
5142031014000201
65141421302431
7555062246440
oct125563720263
932625510731
1011506000051
114974923157
122291404a17
131114a00770
147b21889c7
154751e0301
hex2adcfa0b3

11506000051 has 16 divisors (see below), whose sum is σ = 14192269504. Its totient is φ = 9083695104.

The previous prime is 11506000043. The next prime is 11506000087. The reversal of 11506000051 is 15000060511.

It is a cyclic number.

It is not a de Polignac number, because 11506000051 - 23 = 11506000043 is a prime.

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

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

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

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

Almost surely, 211506000051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 277150.

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

Adding to 11506000051 its reverse (15000060511), we get a palindrome (26506060562).

The spelling of 11506000051 in words is "eleven billion, five hundred six million, fifty-one", and thus it is an aban number.

Divisors: 1 7 13 91 457 3199 5941 41587 276673 1936711 3596749 25177243 126439561 885076927 1643714293 11506000051