Search a number
-
+
23436151015397 is a prime number
BaseRepresentation
bin1010101010000101001110…
…11101001100011111100101
310001222110210122211000022212
411111002213131030133211
511032434214124443042
6121502230311333205
74636130445523241
oct525024735143745
9101873718730285
1023436151015397
1175162412a603a
1227660bb681205
131010033c78c33
145b045c641421
152a9964b15482
hex1550a774c7e5

23436151015397 has 2 divisors, whose sum is σ = 23436151015398. Its totient is φ = 23436151015396.

The previous prime is 23436151015363. The next prime is 23436151015399. The reversal of 23436151015397 is 79351015163432.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 22970462148001 + 465688867396 = 4792751^2 + 682414^2 .

It is a cyclic number.

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

Together with 23436151015399, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 223436151015397 is an apocalyptic number.

It is an amenable number.

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

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

23436151015397 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2041200, while the sum is 50.

The spelling of 23436151015397 in words is "twenty-three trillion, four hundred thirty-six billion, one hundred fifty-one million, fifteen thousand, three hundred ninety-seven".