Search a number
-
+
31253056444453 is a prime number
BaseRepresentation
bin1110001101100101010110…
…10100111101100000100101
311002122202121020110111122211
413012302223110331200211
513044022224422210303
6150245242251323421
76403646605415614
oct706625324754045
9132582536414584
1031253056444453
119a5a38a663148
123609075450571
1314591c5a8198c
147a092810187b
15392e6c84c66d
hex1c6cab53d825

31253056444453 has 2 divisors, whose sum is σ = 31253056444454. Its totient is φ = 31253056444452.

The previous prime is 31253056444397. The next prime is 31253056444501. The reversal of 31253056444453 is 35444465035213.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 25495561771969 + 5757494672484 = 5049313^2 + 2399478^2 .

It is a cyclic number.

It is not a de Polignac number, because 31253056444453 - 225 = 31253022890021 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 31253056444397 and 31253056444406.

It is a congruent number.

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

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

Almost surely, 231253056444453 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10368000, while the sum is 49.

The spelling of 31253056444453 in words is "thirty-one trillion, two hundred fifty-three billion, fifty-six million, four hundred forty-four thousand, four hundred fifty-three".