Search a number
-
+
53051371161 = 3110271603681
BaseRepresentation
bin110001011010000110…
…111010111010011001
312001221020111212221120
4301122012322322121
51332122122334121
640212122555453
73555443133405
oct613206727231
9161836455846
1053051371161
11205541303a8
12a346968b89
135005c9c7a9
1427d3aaa105
1515a76d4bc6
hexc5a1bae99

53051371161 has 8 divisors (see below), whose sum is σ = 70741620384. Its totient is φ = 35364351360.

The previous prime is 53051371159. The next prime is 53051371229. The reversal of 53051371161 is 16117315035.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 53051371161 - 21 = 53051371159 is a prime.

It is not an unprimeable number, because it can be changed into a prime (53051378161) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 768760 + ... + 834921.

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

Almost surely, 253051371161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1614711.

The product of its (nonzero) digits is 9450, while the sum is 33.

Adding to 53051371161 its reverse (16117315035), we get a palindrome (69168686196).

The spelling of 53051371161 in words is "fifty-three billion, fifty-one million, three hundred seventy-one thousand, one hundred sixty-one".

Divisors: 1 3 11027 33081 1603681 4811043 17683790387 53051371161