1016631602952 has 64 divisors (see below), whose sum is σ = 2911594291200. Its totient is φ = 289772915520.

The previous prime is 1016631602929. The next prime is 1016631602957. The reversal of 1016631602952 is 2592061366101.

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

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

It is not an unprimeable number, because it can be changed into a prime (1016631602957) by changing a digit.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7150824 + ... + 7291607.

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

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

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

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 116640, while the sum is 42.

The spelling of 1016631602952 in words is "one trillion, sixteen billion, six hundred thirty-one million, six hundred two thousand, nine hundred fifty-two".