Search a number
-
+
15102321130051 is a prime number
BaseRepresentation
bin1101101111000100100001…
…1111000111101001000011
31222110202201201121100022221
43123301020133013221003
53434414023202130201
652041524402311511
73116051411353111
oct333611037075103
958422651540287
1015102321130051
1148a2949619a81
12183ab20958597
138571b1891c4c
143a2d55d04ab1
151b2ca55464a1
hexdbc487c7a43

15102321130051 has 2 divisors, whose sum is σ = 15102321130052. Its totient is φ = 15102321130050.

The previous prime is 15102321130027. The next prime is 15102321130151. The reversal of 15102321130051 is 15003112320151.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 15102321130051 - 27 = 15102321129923 is a prime.

It is a super-3 number, since 3×151023211300513 (a number of 41 digits) contains 333 as substring.

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

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

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

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

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

Almost surely, 215102321130051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 900, while the sum is 25.

The spelling of 15102321130051 in words is "fifteen trillion, one hundred two billion, three hundred twenty-one million, one hundred thirty thousand, fifty-one".