Search a number
-
+
11360513151 = 321397098403
BaseRepresentation
bin10101001010010001…
…11010110001111111
31002022201210212022100
422211020322301333
5141231242410101
65115143120143
7551344524411
oct124510726177
932281725270
1011360513151
1148aa793749
122250743053
1310c0821b40
1479ab169b1
15467552e86
hex2a523ac7f

11360513151 has 12 divisors (see below), whose sum is σ = 17671909528. Its totient is φ = 6991084944.

The previous prime is 11360513137. The next prime is 11360513207. The reversal of 11360513151 is 15131506311.

It is a happy number.

11360513151 is a `hidden beast` number, since 1 + 1 + 3 + 605 + 1 + 3 + 1 + 51 = 666.

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

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

It is a congruent number.

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

Almost surely, 211360513151 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 27.

It can be divided in two parts, 113605 and 13151, that added together give a triangular number (126756 = T503).

The spelling of 11360513151 in words is "eleven billion, three hundred sixty million, five hundred thirteen thousand, one hundred fifty-one".

Divisors: 1 3 9 13 39 117 97098403 291295209 873885627 1262279239 3786837717 11360513151