50146461435 has 64 divisors (see below), whose sum is σ = 92736829440. Its totient is φ = 22665000960.

The previous prime is 50146461427. The next prime is 50146461437. The reversal of 50146461435 is 53416464105.

It is not a de Polignac number, because 50146461435 - 2³ = 50146461427 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (50146461437) 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, 4990146 + ... + 5000184.

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

Almost surely, 2^50146461435 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10588.

The product of its (nonzero) digits is 172800, while the sum is 39.

The spelling of 50146461435 in words is "fifty billion, one hundred forty-six million, four hundred sixty-one thousand, four hundred thirty-five".