Search a number
-
+
53765115741451 is a prime number
BaseRepresentation
bin11000011100110001010101…
…01000000000010100001011
321001100220011100200100001201
430032120222220000110023
524021341424112211301
6310203204142325031
714216254455240442
oct1416305250002413
9231326140610051
1053765115741451
1116149726200814
126044058589777
13240004ac7132a
14d3c361887d59
15633849d79201
hex30e62aa0050b

53765115741451 has 2 divisors, whose sum is σ = 53765115741452. Its totient is φ = 53765115741450.

The previous prime is 53765115741439. The next prime is 53765115741523. The reversal of 53765115741451 is 15414751156735.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 53765115741451 - 221 = 53765113644299 is a prime.

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

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

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

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

Almost surely, 253765115741451 is an apocalyptic number.

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

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

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

The product of its digits is 8820000, while the sum is 55.

The spelling of 53765115741451 in words is "fifty-three trillion, seven hundred sixty-five billion, one hundred fifteen million, seven hundred forty-one thousand, four hundred fifty-one".