11546525641063 has 8 divisors (see below), whose sum is σ = 13204090422432. Its totient is φ = 9890976139296.

The previous prime is 11546525641019. The next prime is 11546525641069. The reversal of 11546525641063 is 36014652564511.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a de Polignac number, because none of the positive numbers 2^k-11546525641063 is a prime.

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

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

It is a congruent number.

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

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

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

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

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

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

The sum of its prime factors is 1007639801.

The product of its (nonzero) digits is 2592000, while the sum is 49.

The spelling of 11546525641063 in words is "eleven trillion, five hundred forty-six billion, five hundred twenty-five million, six hundred forty-one thousand, sixty-three".