Search a number
-
+
51106014969 = 3191103386341
BaseRepresentation
bin101111100110001001…
…111110011011111001
311212220122222112221020
4233212021332123321
51314131114434334
635251111133053
73456311650122
oct574611763371
9155818875836
1051106014969
111a746016509
129aa3374189
134a85c48459
14268b597049
1514e1a17e49
hexbe627e6f9

51106014969 has 16 divisors (see below), whose sum is σ = 68565218304. Its totient is φ = 33859094400.

The previous prime is 51106014931. The next prime is 51106014979. The reversal of 51106014969 is 96941060115.

It is not a de Polignac number, because 51106014969 - 211 = 51106012921 is a prime.

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

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 51106014969.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 548739 + ... + 635079.

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

Almost surely, 251106014969 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 87568.

The product of its (nonzero) digits is 58320, while the sum is 42.

The spelling of 51106014969 in words is "fifty-one billion, one hundred six million, fourteen thousand, nine hundred sixty-nine".

Divisors: 1 3 191 573 1033 3099 86341 197303 259023 591909 16491131 49473393 89190253 267570759 17035338323 51106014969