Search a number
-
+
23343432230141 is a prime number
BaseRepresentation
bin1010100111011000100001…
…11111000110010011111101
310001122121110221001200222022
411103230100333012103331
511024424322122331031
6121351454050125525
74626336004044122
oct523542077062375
9101577427050868
1023343432230141
11748a991a28391
1227501442808a5
131004378ac39aa
145a9b84620749
152a7339c4297b
hex153b10fc64fd

23343432230141 has 2 divisors, whose sum is σ = 23343432230142. Its totient is φ = 23343432230140.

The previous prime is 23343432230089. The next prime is 23343432230143. The reversal of 23343432230141 is 14103223434332.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 20245230280900 + 3098201949241 = 4499470^2 + 1760171^2 .

It is a cyclic number.

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

Together with 23343432230143, 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 (23343432230143) by changing a digit.

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

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

Almost surely, 223343432230141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 124416, while the sum is 35.

Adding to 23343432230141 its reverse (14103223434332), we get a palindrome (37446655664473).

The spelling of 23343432230141 in words is "twenty-three trillion, three hundred forty-three billion, four hundred thirty-two million, two hundred thirty thousand, one hundred forty-one".