Search a number
-
+
23465414331589 is a prime number
BaseRepresentation
bin1010101010111011101111…
…01011111000110011000101
310002002021100001220111111111
411111131313223320303011
511033424132032102324
6121523510150005021
74641214561564006
oct525356753706305
9102067301814444
1023465414331589
11752769871467a
12276b907946771
131012a18829649
145b1a36cc31ad
152aa5c8c22794
hex155777af8cc5

23465414331589 has 2 divisors, whose sum is σ = 23465414331590. Its totient is φ = 23465414331588.

The previous prime is 23465414331539. The next prime is 23465414331631. The reversal of 23465414331589 is 98513341456432.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 21871803492900 + 1593610838689 = 4676730^2 + 1262383^2 .

It is a cyclic number.

It is not a de Polignac number, because 23465414331589 - 213 = 23465414323397 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 223465414331589 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 37324800, while the sum is 58.

The spelling of 23465414331589 in words is "twenty-three trillion, four hundred sixty-five billion, four hundred fourteen million, three hundred thirty-one thousand, five hundred eighty-nine".