1463132110000 has 300 divisors, whose sum is σ = 3993393136392. Its totient is φ = 514848000000.

The previous prime is 1463132109961. The next prime is 1463132110001. The reversal of 1463132110000 is 112313641.

It is a Harshad number since it is a multiple of its sum of digits (22).

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

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

1463132110000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 432, while the sum is 22.

Adding to 1463132110000 its reverse (112313641), we get a palindrome (1463244423641).

The spelling of 1463132110000 in words is "one trillion, four hundred sixty-three billion, one hundred thirty-two million, one hundred ten thousand".