Search a number
-
+
152511096000 = 2635319732257
BaseRepresentation
bin1000111000001001011…
…1101010010011000000
3112120122202112102000010
42032002113222103000
54444320320033000
6154021310024520
714006236632564
oct2160227522300
9476582472003
10152511096000
11597525a07aa
12256837a8140
13114c6895293
14754b08d6a4
153e7929cd50
hex23825ea4c0

152511096000 has 224 divisors, whose sum is σ = 506163632832. Its totient is φ = 40461926400.

The previous prime is 152511095999. The next prime is 152511096007. The reversal of 152511096000 is 690115251.

152511096000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4711872 + ... + 4744128.

Almost surely, 2152511096000 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 152511096000 in words is "one hundred fifty-two billion, five hundred eleven million, ninety-six thousand".