Search a number
-
+
51115506665167 = 78538560627477
BaseRepresentation
bin10111001111101010000011…
…00111100000011011001111
320200222121001112202020111201
423213311001213200123033
523144434024201241132
6300414050052330331
713523654622552040
oct1347650147403317
9220877045666451
1051115506665167
1115317a67a3013a
12589663b9139a7
13226a22ccc4069
14c8a00a3048c7
155d9971b582e7
hex2e7d419e06cf

51115506665167 has 8 divisors (see below), whose sum is σ = 58486206929696. Its totient is φ = 43761927657312.

The previous prime is 51115506665147. The next prime is 51115506665221. The reversal of 51115506665167 is 76156660551115.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-51115506665167 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 251115506665167 is an apocalyptic number.

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

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

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

The sum of its prime factors is 8560628337.

The product of its (nonzero) digits is 5670000, while the sum is 55.

The spelling of 51115506665167 in words is "fifty-one trillion, one hundred fifteen billion, five hundred six million, six hundred sixty-five thousand, one hundred sixty-seven".

Divisors: 1 7 853 5971 8560627477 59924392339 7302215237881 51115506665167