11277041540646 has 64 divisors (see below), whose sum is σ = 26105877780480. Its totient is φ = 3180799964160.

The previous prime is 11277041540621. The next prime is 11277041540651. The reversal of 11277041540646 is 64604514077211.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24916206 + ... + 25364766.

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

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

It is a practical number, because each smaller number is the sum of distinct divisors of 11277041540646, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13052938890240).

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

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

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

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

The sum of its prime factors is 456229.

The product of its (nonzero) digits is 1128960, while the sum is 48.

The spelling of 11277041540646 in words is "eleven trillion, two hundred seventy-seven billion, forty-one million, five hundred forty thousand, six hundred forty-six".