1016950621501 has 8 divisors (see below), whose sum is σ = 1024787371608. Its totient is φ = 1009138248000.

The previous prime is 1016950621411. The next prime is 1016950621513. The reversal of 1016950621501 is 1051260596101.

It can be written as a sum of positive squares in 4 ways, for example, as 85658070276 + 931292551225 = 292674^2 + 965035^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1016950621501 - 2¹¹ = 1016950619453 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 12188303.

The product of its (nonzero) digits is 16200, while the sum is 37.

The spelling of 1016950621501 in words is "one trillion, sixteen billion, nine hundred fifty million, six hundred twenty-one thousand, five hundred one".