Search a number
-
+
1395271099200 = 263521126425589
BaseRepresentation
bin10100010011011100101…
…000110110001101000000
311221101102211201202002210
4110103130220312031000
5140330003400133300
62544551221542120
7202543055442156
oct24233450661500
94841384652083
101395271099200
11498805185110
121a64b5574940
13a175bc97514
144b7625573d6
1526462e09050
hex144dca36340

1395271099200 has 168 divisors, whose sum is σ = 4993802295840. Its totient is φ = 338247526400.

The previous prime is 1395271099181. The next prime is 1395271099207. The reversal of 1395271099200 is 29901725931.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1395271099207) 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 23 ways as a sum of consecutive naturals, for example, 13159995 + ... + 13265594.

Almost surely, 21395271099200 is an apocalyptic number.

1395271099200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 306180, while the sum is 48.

The spelling of 1395271099200 in words is "one trillion, three hundred ninety-five billion, two hundred seventy-one million, ninety-nine thousand, two hundred".