Search a number
-
+
153014626030000 = 2454721921974391
BaseRepresentation
bin100010110010101001111110…
…011011100001000110110000
3202001210001111101012101011111
4202302221332123201012300
5130023442423230430000
61301233540534123104
744141641035210400
oct4262517633410660
9661701441171144
10153014626030000
1144834158346839
12151b33147b0494
13674c2a95b8527
1429add399ca800
1512a53dcc16cba
hex8b2a7e6e11b0

153014626030000 has 900 divisors, whose sum is σ = 457235646219792. Its totient is φ = 49437440640000.

The previous prime is 153014626029973. The next prime is 153014626030067. The reversal of 153014626030000 is 30626410351.

It is an unprimeable number.

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

It is a polite number, since it can be written in 179 ways as a sum of consecutive naturals, for example, 34847327805 + ... + 34847332195.

Almost surely, 2153014626030000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 31.

The spelling of 153014626030000 in words is "one hundred fifty-three trillion, fourteen billion, six hundred twenty-six million, thirty thousand".