145101211563 has 64 divisors (see below), whose sum is σ = 246781624320. Its totient is φ = 73654963200.

The previous prime is 145101211531. The next prime is 145101211589. The reversal of 145101211563 is 365112101541.

145101211563 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 145101211563 - 2⁵ = 145101211531 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 145101211563.

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

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1729168 + ... + 1811138.

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

Almost surely, 2^145101211563 is an apocalyptic number.

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

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

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

The sum of its prime factors is 82168.

The product of its (nonzero) digits is 3600, while the sum is 30.

The spelling of 145101211563 in words is "one hundred forty-five billion, one hundred one million, two hundred eleven thousand, five hundred sixty-three".