Search a number
-
+
5301110707200 = 210365272111731
BaseRepresentation
bin100110100100100001011…
…0100100001010000000000
3200202210002112000221000000
41031021002310201100000
51143323133320112300
615135144024000000
71054664315354100
oct115110264412000
920683075027000
105301110707200
1117642088815a0
12717483300000
132c5b7b052269
1414480a213200
1592d6267dc00
hex4d242d21400

5301110707200 has 5544 divisors, whose sum is σ = 27326139657984. Its totient is φ = 1003290624000.

The previous prime is 5301110707199. The next prime is 5301110707201. The reversal of 5301110707200 is 27070111035.

It is a happy number.

5301110707200 is a `hidden beast` number, since 530 + 1 + 1 + 107 + 0 + 7 + 20 + 0 = 666.

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

It is a tau number, because it is divible by the number of its divisors (5544).

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 503 ways as a sum of consecutive naturals, for example, 171003571185 + ... + 171003571215.

Almost surely, 25301110707200 is an apocalyptic number.

5301110707200 is a gapful number since it is divisible by the number (50) 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 5301110707200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13663069828992).

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

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

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

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

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

The product of its (nonzero) digits is 1470, while the sum is 27.

Adding to 5301110707200 its reverse (27070111035), we get a palindrome (5328180818235).

The spelling of 5301110707200 in words is "five trillion, three hundred one billion, one hundred ten million, seven hundred seven thousand, two hundred".