Search a number
-
+
112023213222013 is a prime number
BaseRepresentation
bin11001011110001001101111…
…110101001010100001111101
3112200122022111100011111021121
4121132021233311022201331
5104140342020041101023
61034130430444430541
732411260440251002
oct3136115765124175
9480568440144247
10112023213222013
113276a861474285
1210692a23548451
134a67988b2b252
141d93d497438a9
15ce3eaa5bbd5d
hex65e26fd4a87d

112023213222013 has 2 divisors, whose sum is σ = 112023213222014. Its totient is φ = 112023213222012.

The previous prime is 112023213221987. The next prime is 112023213222047. The reversal of 112023213222013 is 310222312320211.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 106427324915044 + 5595888306969 = 10316362^2 + 2365563^2 .

It is an emirp because it is prime and its reverse (310222312320211) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 112023213222013 - 29 = 112023213221501 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2112023213222013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 112023213222013 its reverse (310222312320211), we get a palindrome (422245525542224).

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