4895246913072 has 160 divisors (see below), whose sum is σ = 12789574272000. Its totient is φ = 1613349771264.

The previous prime is 4895246913071. The next prime is 4895246913131. The reversal of 4895246913072 is 2703196425984.

It is a happy number.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅4895246913072 = 9790493826144 is not.

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

It is an amenable number.

4895246913072 is an abundant number, since it is smaller than the sum of its proper divisors (7894327358928).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 26127360, while the sum is 60.

The spelling of 4895246913072 in words is "four trillion, eight hundred ninety-five billion, two hundred forty-six million, nine hundred thirteen thousand, seventy-two".