Search a number
-
+
53095400129 is a prime number
BaseRepresentation
bin110001011100101110…
…111000001011000001
312002001022100210100002
4301130232320023001
51332214410301004
640220334405345
73556516311632
oct613456701301
9162038323302
1053095400129
1120576a72a82
12a359660855
135012147135
1427d988b889
1515ab4d061e
hexc5cbb82c1

53095400129 has 2 divisors, whose sum is σ = 53095400130. Its totient is φ = 53095400128.

The previous prime is 53095400087. The next prime is 53095400147. The reversal of 53095400129 is 92100459035.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 49607316529 + 3488083600 = 222727^2 + 59060^2 .

It is a cyclic number.

It is not a de Polignac number, because 53095400129 - 232 = 48800432833 is a prime.

It is a super-2 number, since 2×530954001292 (a number of 22 digits) contains 22 as substring.

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

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

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

Almost surely, 253095400129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48600, while the sum is 38.

The spelling of 53095400129 in words is "fifty-three billion, ninety-five million, four hundred thousand, one hundred twenty-nine".