Search a number
-
+
48916366767 = 3247115641529
BaseRepresentation
bin101101100011101001…
…001000010110101111
311200021001202220021200
4231203221020112233
51300140042214032
634245531300543
73351123154122
oct554351102657
9150231686250
1048916366767
11198220173a4
129591baa753
1347c73cc828
1425208523b9
15141469347c
hexb63a485af

48916366767 has 12 divisors (see below), whose sum is σ = 72160314720. Its totient is φ = 31917061728.

The previous prime is 48916366753. The next prime is 48916366771. The reversal of 48916366767 is 76766361984.

48916366767 is a `hidden beast` number, since 489 + 1 + 6 + 36 + 67 + 67 = 666.

It is not a de Polignac number, because 48916366767 - 220 = 48915318191 is a prime.

It is a congruent number.

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

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

Almost surely, 248916366767 is an apocalyptic number.

48916366767 is a gapful number since it is divisible by the number (47) formed by its first and last digit.

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

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

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

The sum of its prime factors is 115641582 (or 115641579 counting only the distinct ones).

The product of its digits is 54867456, while the sum is 63.

The spelling of 48916366767 in words is "forty-eight billion, nine hundred sixteen million, three hundred sixty-six thousand, seven hundred sixty-seven".

Divisors: 1 3 9 47 141 423 115641529 346924587 1040773761 5435151863 16305455589 48916366767