151016952 has 32 divisors (see below), whose sum is σ = 381214080. Its totient is φ = 49849440.

The previous prime is 151016951. The next prime is 151017023. The reversal of 151016952 is 259610151.

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

It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.

It is a congruent number.

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

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 7 ways as a sum of consecutive naturals, for example, 28074 + ... + 33017.

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

Almost surely, 2^151016952 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The square root of 151016952 is about 12288.8954751841. The cubic root of 151016952 is about 532.5273287127.

The spelling of 151016952 in words is "one hundred fifty-one million, sixteen thousand, nine hundred fifty-two".