Search a number
-
+
10641110016000 = 21335317375507
BaseRepresentation
bin1001101011011001001110…
…0101010010000000000000
31101200021120020211111111210
42122312103211102000000
52343320443131003000
634344243005410120
72145536424513342
oct232662345220000
941607506744453
1010641110016000
113432962211052
12123a39a269940
135c25b5b14b89
1428b065169292
15136bede5b350
hex9ad93952000

10641110016000 has 896 divisors, whose sum is σ = 38514836116224. Its totient is φ = 2598056755200.

The previous prime is 10641110015999. The next prime is 10641110016041. The reversal of 10641110016000 is 61001114601.

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

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1932285247 + ... + 1932290753.

Almost surely, 210641110016000 is an apocalyptic number.

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

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

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

10641110016000 is an equidigital number, since it uses as much as digits as its factorization.

10641110016000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 144, while the sum is 21.

The spelling of 10641110016000 in words is "ten trillion, six hundred forty-one billion, one hundred ten million, sixteen thousand".