Search a number
-
+
112324340000401 is a prime number
BaseRepresentation
bin11001100010100010001100…
…011000101010011010010001
3112201201002202101022210101121
4121202202030120222122101
5104210310222020003101
61034521031152402241
732442110566526464
oct3142421430523221
9481632671283347
10112324340000401
1132876537705891
1210721262246381
134a8a1a8225319
141da47543952db
15cebc31b510a1
hex66288c62a691

112324340000401 has 2 divisors, whose sum is σ = 112324340000402. Its totient is φ = 112324340000400.

The previous prime is 112324340000329. The next prime is 112324340000479. The reversal of 112324340000401 is 104000043423211.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 60893067166801 + 51431272833600 = 7803401^2 + 7171560^2 .

It is a cyclic number.

It is not a de Polignac number, because 112324340000401 - 219 = 112324339476113 is a prime.

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

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

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

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

Almost surely, 2112324340000401 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 112324340000401 its reverse (104000043423211), we get a palindrome (216324383423612).

The spelling of 112324340000401 in words is "one hundred twelve trillion, three hundred twenty-four billion, three hundred forty million, four hundred one", and thus it is an aban number.