10490462140536 has 384 divisors, whose sum is σ = 34521956352000. Its totient is φ = 2811105305856.

The previous prime is 10490462140511. The next prime is 10490462140567. The reversal of 10490462140536 is 63504126409401.

10490462140536 is a `hidden beast` number, since 1 + 0 + 4 + 90 + 4 + 6 + 21 + 4 + 0 + 536 = 666.

It is a super-2 number, since 2×10490462140536² (a number of 27 digits) contains 22 as substring.

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

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 95 ways as a sum of consecutive naturals, for example, 2261360505 + ... + 2261365143.

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

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

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 622080, while the sum is 45.

Adding to 10490462140536 its reverse (63504126409401), we get a palindrome (73994588549937).

The spelling of 10490462140536 in words is "ten trillion, four hundred ninety billion, four hundred sixty-two million, one hundred forty thousand, five hundred thirty-six".