Search a number
-
+
154521093120 = 2103537972803
BaseRepresentation
bin1000111111101000101…
…1001100010000000000
3112202211211200211200220
42033322023030100000
510012424344434440
6154552551143040
714110114422522
oct2177213142000
9482754624626
10154521093120
115a594146349
1225b44974a80
131175712caa4
14769bdcba12
1540459878d0
hex23fa2cc400

154521093120 has 352 divisors, whose sum is σ = 512999292288. Its totient is φ = 39664484352.

The previous prime is 154521093101. The next prime is 154521093127. The reversal of 154521093120 is 21390125451.

It is a happy number.

It is a super-2 number, since 2×1545210931202 (a number of 23 digits) contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (154521093127) 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, 55125639 + ... + 55128441.

Almost surely, 2154521093120 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 154521093120 in words is "one hundred fifty-four billion, five hundred twenty-one million, ninety-three thousand, one hundred twenty".