916950125145 has 64 divisors (see below), whose sum is σ = 1571495067648. Its totient is φ = 455747040000.

The previous prime is 916950125141. The next prime is 916950125153. The reversal of 916950125145 is 541521059619.

It is not a de Polignac number, because 916950125145 - 2² = 916950125141 is a prime.

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

It is a Curzon number.

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

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

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

Almost surely, 2^916950125145 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 646054.

The product of its (nonzero) digits is 486000, while the sum is 48.

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