Search a number
-
+
151073931750 = 2353743279197
BaseRepresentation
bin1000110010110010110…
…1010100000111100110
3112102221121020220021120
42030230231110013212
54433344411304000
6153222530354410
713625516142420
oct2145455240746
9472847226246
10151073931750
1159085328a55
122534242ba06
1311327c03931
147452265810
153de30166a0
hex232cb541e6

151073931750 has 384 divisors, whose sum is σ = 449057157120. Its totient is φ = 33132153600.

The previous prime is 151073931727. The next prime is 151073931761. The reversal of 151073931750 is 57139370151.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 766872652 + ... + 766872848.

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

Almost surely, 2151073931750 is an apocalyptic number.

151073931750 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 151073931750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (224528578560).

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

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

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

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

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

The product of its (nonzero) digits is 99225, while the sum is 42.

The spelling of 151073931750 in words is "one hundred fifty-one billion, seventy-three million, nine hundred thirty-one thousand, seven hundred fifty".