Search a number
-
+
1350241063600 = 24521113231026331
BaseRepresentation
bin10011101001100000101…
…000111001001010110000
311210002012121202220221111
4103221200220321022300
5134110243203013400
62512143040003104
7166360142446432
oct23514050711260
94702177686844
101350241063600
114806a7974960
12199829000494
139a433a9b140
14494cdd0a652
15251c9a363ba
hex13a60a392b0

1350241063600 has 240 divisors, whose sum is σ = 3976781969664. Its totient is φ = 433521792000.

The previous prime is 1350241063597. The next prime is 1350241063601. The reversal of 1350241063600 is 63601420531.

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

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 47 ways as a sum of consecutive naturals, for example, 802435 + ... + 1828765.

Almost surely, 21350241063600 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 1350241063600 in words is "one trillion, three hundred fifty billion, two hundred forty-one million, sixty-three thousand, six hundred".