Search a number
-
+
191157252000 = 253531121321941
BaseRepresentation
bin1011001000000111011…
…1000010111110100000
3200021102002002112200020
42302001313002332200
511112442224031000
6223452203153440
716545024555411
oct2620167027640
9607362075606
10191157252000
1174084315800
123106a215880
1315045309900
149375921808
154e8beaaba0
hex2c81dc2fa0

191157252000 has 1728 divisors, whose sum is σ = 803724405120. Its totient is φ = 39536640000.

The previous prime is 191157251969. The next prime is 191157252037. The reversal of 191157252000 is 252751191.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 4662371980 + ... + 4662372020.

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

Almost surely, 2191157252000 is an apocalyptic number.

191157252000 is a gapful number since it is divisible by the number (10) 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 191157252000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (401862202560).

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

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

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

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

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

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

The spelling of 191157252000 in words is "one hundred ninety-one billion, one hundred fifty-seven million, two hundred fifty-two thousand".