Search a number
-
+
53151115333 is a prime number
BaseRepresentation
bin110001100000000011…
…011010100001000101
312002012012012102020011
4301200003122201011
51332323141142313
640230044510221
73561064011631
oct614003324105
9162165172204
1053151115333
11205a54676a8
12a37424b371
135020853a04
142803031dc1
1515b133893d
hexc600da845

53151115333 has 2 divisors, whose sum is σ = 53151115334. Its totient is φ = 53151115332.

The previous prime is 53151115331. The next prime is 53151115363. The reversal of 53151115333 is 33351115135.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 53113194369 + 37920964 = 230463^2 + 6158^2 .

It is a cyclic number.

It is not a de Polignac number, because 53151115333 - 21 = 53151115331 is a prime.

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

Together with 53151115331, it forms a pair of twin primes.

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

It is a congruent number.

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

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

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

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

Almost surely, 253151115333 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 10125, while the sum is 31.

The spelling of 53151115333 in words is "fifty-three billion, one hundred fifty-one million, one hundred fifteen thousand, three hundred thirty-three".