145951050 has 96 divisors (see below), whose sum is σ = 418223232. Its totient is φ = 32993280.

The previous prime is 145951049. The next prime is 145951063. The reversal of 145951050 is 50159541.

It is a super-2 number, since 2×145951050² = 42603417992205000, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (30).

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 101134 + ... + 102566.

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

Almost surely, 2^145951050 is an apocalyptic number.

145951050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 145951050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (209111616).

145951050 is an abundant number, since it is smaller than the sum of its proper divisors (272272182).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 1552 (or 1547 counting only the distinct ones).

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

The square root of 145951050 is about 12081.0202383739. The cubic root of 145951050 is about 526.5048885333.

The spelling of 145951050 in words is "one hundred forty-five million, nine hundred fifty-one thousand, fifty".