Search a number
-
+
12151103265031 is a prime number
BaseRepresentation
bin1011000011010010011000…
…1100011001100100000111
31121000122010021112021202211
42300310212030121210013
53043040424413440111
641502050105244251
72362613444405623
oct260644614314407
947018107467684
1012151103265031
113965288018335
121442b6ba93687
136a1ac86c3b93
1430018babc183
151611287cd521
hexb0d26319907

12151103265031 has 2 divisors, whose sum is σ = 12151103265032. Its totient is φ = 12151103265030.

The previous prime is 12151103265001. The next prime is 12151103265101. The reversal of 12151103265031 is 13056230115121.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 12151103265031 - 215 = 12151103232263 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (12151103265001) 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 as a sum of consecutive naturals, namely, 6075551632515 + 6075551632516.

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

Almost surely, 212151103265031 is an apocalyptic number.

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

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

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

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

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