Search a number
-
+
15295397152361 is a prime number
BaseRepresentation
bin1101111010010011110010…
…1101101100011001101001
32000011020002112012112001012
43132210330231230121221
54001044433132333421
652310335231433305
73136025125436204
oct336447455543151
960136075175035
1015295397152361
114967817a40267
121870425685835
1386c471574bb1
143ac4305b893b
151b7d05bbb95b
hexde93cb6c669

15295397152361 has 2 divisors, whose sum is σ = 15295397152362. Its totient is φ = 15295397152360.

The previous prime is 15295397152331. The next prime is 15295397152367. The reversal of 15295397152361 is 16325179359251.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14864641209961 + 430755942400 = 3855469^2 + 656320^2 .

It is a cyclic number.

It is not a de Polignac number, because 15295397152361 - 210 = 15295397151337 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 15295397152361.

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

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

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

Almost surely, 215295397152361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 15309000, while the sum is 59.

The spelling of 15295397152361 in words is "fifteen trillion, two hundred ninety-five billion, three hundred ninety-seven million, one hundred fifty-two thousand, three hundred sixty-one".