Search a number
-
+
253315651013 is a prime number
BaseRepresentation
bin1110101111101011001…
…0100001010111000101
3220012212000002101020122
43223322302201113011
513122242301313023
6312212133311325
724205253335535
oct3537262412705
9805760071218
10253315651013
11984810989a7
1241116a95545
131ab6cc90c79
14c390d034c5
1568c8e5e2c8
hex3afaca15c5

253315651013 has 2 divisors, whose sum is σ = 253315651014. Its totient is φ = 253315651012.

The previous prime is 253315650997. The next prime is 253315651031. The reversal of 253315651013 is 310156513352.

Together with next prime (253315651031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 151502328289 + 101813322724 = 389233^2 + 319082^2 .

It is a cyclic number.

It is not a de Polignac number, because 253315651013 - 24 = 253315650997 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2253315651013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 40500, while the sum is 35.

The spelling of 253315651013 in words is "two hundred fifty-three billion, three hundred fifteen million, six hundred fifty-one thousand, thirteen".