Search a number
-
+
51629984161 = 773101037151
BaseRepresentation
bin110000000101011000…
…110000100110100001
311221021011220221112121
4300011120300212201
51321214233443121
635415105424241
73505303424110
oct600530604641
9157234827477
1051629984161
111a9948642a8
12a00a93b081
134b3a6734b2
1426dadcbc77
151522a18141
hexc056309a1

51629984161 has 8 divisors (see below), whose sum is σ = 59813993984. Its totient is φ = 43648048800.

The previous prime is 51629984141. The next prime is 51629984171. The reversal of 51629984161 is 16148992615.

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

It is a cyclic number.

It is not a de Polignac number, because 51629984161 - 217 = 51629853089 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 251629984161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 101037231.

The product of its digits is 933120, while the sum is 52.

The spelling of 51629984161 in words is "fifty-one billion, six hundred twenty-nine million, nine hundred eighty-four thousand, one hundred sixty-one".

Divisors: 1 7 73 511 101037151 707260057 7375712023 51629984161