Search a number
-
+
153996960000 = 2835413232937
BaseRepresentation
bin1000111101101011101…
…1110010000100000000
3112201111022110010020010
42033122323302010000
510010341210210000
6154424545144520
714061121363602
oct2173273620400
9481438403203
10153996960000
115a3452a6384
1225a1932b140
13116a2678250
14764c553172
154014953d50
hex23daef2100

153996960000 has 1440 divisors, whose sum is σ = 611471266560. Its totient is φ = 34062336000.

The previous prime is 153996959999. The next prime is 153996960043. The reversal of 153996960000 is 69699351.

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

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 159 ways as a sum of consecutive naturals, for example, 4162079982 + ... + 4162080018.

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

Almost surely, 2153996960000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 393660, while the sum is 48.

The spelling of 153996960000 in words is "one hundred fifty-three billion, nine hundred ninety-six million, nine hundred sixty thousand".