Search a number
-
+
23013003222241 is a prime number
BaseRepresentation
bin1010011101110001000011…
…11000011101110011100001
310000111000120202120220122121
411032320201320131303201
511004021112311102431
6120540005553504241
74563430446603634
oct516704170356341
9100430522526577
1023013003222241
11737283a40a07a
1226b80a8272081
13cac169a73186
14597b9a0bbc1b
1529d94ae66611
hex14ee21e1dce1

23013003222241 has 2 divisors, whose sum is σ = 23013003222242. Its totient is φ = 23013003222240.

The previous prime is 23013003222239. The next prime is 23013003222343. The reversal of 23013003222241 is 14222230031032.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 19863993265216 + 3149009957025 = 4456904^2 + 1774545^2 .

It is a cyclic number.

It is not a de Polignac number, because 23013003222241 - 21 = 23013003222239 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 223013003222241 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3456, while the sum is 25.

Adding to 23013003222241 its reverse (14222230031032), we get a palindrome (37235233253273).

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