Search a number
-
+
15302326264051 is a prime number
BaseRepresentation
bin1101111010101101100110…
…1110001010000011110011
32000011212222102112212100111
43132223121232022003303
54001203131010422201
652313442554402151
73136361624062051
oct336533156120363
960155872485314
1015302326264051
11496a753277452
12187183a130357
13870006c8ab98
143ac8ca9611d1
151b80ae181b51
hexdead9b8a0f3

15302326264051 has 2 divisors, whose sum is σ = 15302326264052. Its totient is φ = 15302326264050.

The previous prime is 15302326264019. The next prime is 15302326264073. The reversal of 15302326264051 is 15046262320351.

It is a strong prime.

It is an emirp because it is prime and its reverse (15046262320351) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 15302326264051 - 25 = 15302326264019 is a prime.

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

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

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

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

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

Almost surely, 215302326264051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 259200, while the sum is 40.

The spelling of 15302326264051 in words is "fifteen trillion, three hundred two billion, three hundred twenty-six million, two hundred sixty-four thousand, fifty-one".