Search a number
-
+
1331646316000 = 255371113225583
BaseRepresentation
bin10011011000001100010…
…011100011110111100000
311201022012201110212120221
4103120030103203313200
5133304202424103000
62455425550012424
7165131302632340
oct23301423436740
94638181425527
101331646316000
114738256a1860
121960b97a7114
139875c590900
1448648502d20
152498c34b61a
hex1360c4e3de0

1331646316000 has 576 divisors, whose sum is σ = 4417290049536. Its totient is φ = 383116032000.

The previous prime is 1331646315931. The next prime is 1331646316019. The reversal of 1331646316000 is 6136461331.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 52039209 + ... + 52064791.

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

Almost surely, 21331646316000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 23328, while the sum is 34.

The spelling of 1331646316000 in words is "one trillion, three hundred thirty-one billion, six hundred forty-six million, three hundred sixteen thousand".