101968152 has 192 divisors, whose sum is σ = 314156640. Its totient is φ = 27371520.

The previous prime is 101968151. The next prime is 101968157. The reversal of 101968152 is 251869101.

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

It is a congruent number.

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

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

Almost surely, 2^101968152 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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

The square root of 101968152 is about 10097.9281043192. The cubic root of 101968152 is about 467.1842389089.

The spelling of 101968152 in words is "one hundred one million, nine hundred sixty-eight thousand, one hundred fifty-two".