Search a number
-
+
53319551053 = 463271150939
BaseRepresentation
bin110001101010000101…
…111100100001001101
312002121221010211121011
4301222011330201031
51333144301113203
640254503005221
73565210464106
oct615205744115
9162557124534
1053319551053
112068155097a
12a400739811
135049709012
14281b5593ad
1515c100a76d
hexc6a17c84d

53319551053 has 4 divisors (see below), whose sum is σ = 53320748320. Its totient is φ = 53318353788.

The previous prime is 53319551041. The next prime is 53319551063. The reversal of 53319551053 is 35015591335.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 53319551053 - 229 = 52782680141 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (53319551063) 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 in 3 ways as a sum of consecutive naturals, for example, 529143 + ... + 621796.

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

Almost surely, 253319551053 is an apocalyptic number.

It is an amenable number.

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

53319551053 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1197266.

The product of its (nonzero) digits is 151875, while the sum is 40.

The spelling of 53319551053 in words is "fifty-three billion, three hundred nineteen million, five hundred fifty-one thousand, fifty-three".

Divisors: 1 46327 1150939 53319551053