Search a number
-
+
13151265133 is a prime number
BaseRepresentation
bin11000011111110000…
…00110000101101101
31020221112102111012211
430033320012011231
5203413210441013
610012553130421
7643620623566
oct141770060555
936845374184
1013151265133
115639601166
1226703b9a11
1313178246b6
148ca8a316d
1551e88123d
hex30fe0616d

13151265133 has 2 divisors, whose sum is σ = 13151265134. Its totient is φ = 13151265132.

The previous prime is 13151265107. The next prime is 13151265143. The reversal of 13151265133 is 33156215131.

13151265133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11354607364 + 1796657769 = 106558^2 + 42387^2 .

It is a cyclic number.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (13151265143) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6575632566 + 6575632567.

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

Almost surely, 213151265133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 8100, while the sum is 31.

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