145010011 has 2 divisors, whose sum is σ = 145010012. Its totient is φ = 145010010.

The previous prime is 145009999. The next prime is 145010029. The reversal of 145010011 is 110010541.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 145010011 - 2⁹ = 145009499 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (145010911) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72505005 + 72505006.

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

Almost surely, 2^145010011 is an apocalyptic number.

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

145010011 is an equidigital number, since it uses as much as digits as its factorization.

145010011 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 20, while the sum is 13.

The square root of 145010011 is about 12042.0102557671. The cubic root of 145010011 is about 525.3708774695.

Adding to 145010011 its reverse (110010541), we get a palindrome (255020552).

The spelling of 145010011 in words is "one hundred forty-five million, ten thousand, eleven".