146101056531 has 16 divisors (see below), whose sum is σ = 195290726400. Its totient is φ = 97156150848.

The previous prime is 146101056509. The next prime is 146101056547. The reversal of 146101056531 is 135650101641.

It is not a de Polignac number, because 146101056531 - 2⁶ = 146101056467 is a prime.

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

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

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

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

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

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

Almost surely, 2^146101056531 is an apocalyptic number.

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

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

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

The sum of its prime factors is 26338.

The product of its (nonzero) digits is 10800, while the sum is 33.

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