Search a number
-
+
225326113057 is a prime number
BaseRepresentation
bin1101000111011001111…
…0111010000100100001
3210112121100211112022201
43101312132322010201
512142431441104212
6251302520333201
722164535234213
oct3216636720441
9715540745281
10225326113057
1187618797851
1237805314201
131832c2971a6
14ac978b85b3
155cdbab2b57
hex34767ba121

225326113057 has 2 divisors, whose sum is σ = 225326113058. Its totient is φ = 225326113056.

The previous prime is 225326113007. The next prime is 225326113069. The reversal of 225326113057 is 750311623522.

It is a happy number.

225326113057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 117752608801 + 107573504256 = 343151^2 + 327984^2 .

It is a cyclic number.

It is not a de Polignac number, because 225326113057 - 211 = 225326111009 is a prime.

It is not a weakly prime, because it can be changed into another prime (225326113007) 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, 112663056528 + 112663056529.

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

Almost surely, 2225326113057 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 225326113057 its reverse (750311623522), we get a palindrome (975637736579).

The spelling of 225326113057 in words is "two hundred twenty-five billion, three hundred twenty-six million, one hundred thirteen thousand, fifty-seven".