Search a number
-
+
1311200200000 = 2655291811249
BaseRepresentation
bin10011000101001001100…
…111110100010101000000
311122100102210111120020101
4103011021213310111000
5132440314222400000
62442205042452144
7163505522543605
oct23051147642500
94570383446211
101311200200000
1146609336a229
12192152364054
1396851649112
1447668c906ac
152419235ce6a
hex131499f4540

1311200200000 has 336 divisors, whose sum is σ = 3385623150000. Its totient is φ = 503193600000.

The previous prime is 1311200199931. The next prime is 1311200200069. The reversal of 1311200200000 is 20021131.

It is an interprime number because it is at equal distance from previous prime (1311200199931) and next prime (1311200200069).

It can be written as a sum of positive squares in 24 ways, for example, as 730300139776 + 580900060224 = 854576^2 + 762168^2 .

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

It is a self number, because there is not a number n which added to its sum of digits gives 1311200200000.

It is a congruent number.

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

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

Almost surely, 21311200200000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 12, while the sum is 10.

Adding to 1311200200000 its reverse (20021131), we get a palindrome (1311220221131).

The spelling of 1311200200000 in words is "one trillion, three hundred eleven billion, two hundred million, two hundred thousand".