4851609753769 has 27 divisors (see below), whose sum is σ = 5068247867319. Its totient is φ = 4644039850800.

The previous prime is 4851609753761. The next prime is 4851609753779. The reversal of 4851609753769 is 9673579061584.

The square root of 4851609753769 is 2202637.

It is a perfect power (a square), and thus also a powerful number.

4851609753769 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in only one way, i.e., 2544066470169 + 2307543283600 = 1595013^2 + 1519060^2 .

It is not a de Polignac number, because 4851609753769 - 2³ = 4851609753761 is a prime.

It is a super-2 number, since 2×4851609753769² (a number of 26 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 = 4851609753698 and 4851609753707.

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

It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 9645347172 + ... + 9645347674.

Almost surely, 2^{4851609753769} is an apocalyptic number.

4851609753769 is the 2202637-th square number.

4851609753769 is the 1101319-th centered octagonal number.

It is an amenable number.

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

4851609753769 is an frugal number, since it uses more digits than its factorization.

4851609753769 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 342921600, while the sum is 70.

The spelling of 4851609753769 in words is "four trillion, eight hundred fifty-one billion, six hundred nine million, seven hundred fifty-three thousand, seven hundred sixty-nine".