Search a number
-
+
5123226104641 is a prime number
BaseRepresentation
bin100101010001101100000…
…0100100111001101000001
3200010202221102202211111201
41022203120010213031001
51132414331340322031
614521324431341201
71036066214240341
oct112433004471501
920122842684451
105123226104641
1116a5825634867
126a8aba081801
132b216c75a098
14139d73350d21
158d400a2ed61
hex4a8d8127341

5123226104641 has 2 divisors, whose sum is σ = 5123226104642. Its totient is φ = 5123226104640.

The previous prime is 5123226104627. The next prime is 5123226104657. The reversal of 5123226104641 is 1464016223215.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3478676344641 + 1644549760000 = 1865121^2 + 1282400^2 .

It is a cyclic number.

It is not a de Polignac number, because 5123226104641 - 25 = 5123226104609 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 5123226104641.

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

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

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

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

Almost surely, 25123226104641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 69120, while the sum is 37.

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