Search a number
-
+
131331010200 = 233521331543139
BaseRepresentation
bin111101001001111110…
…0000010111010011000
3110112222200110120100220
41322103330002322120
54122431214311300
6140155503200040
712326335111365
oct1722374027230
9415880416326
10131331010200
1150773a27865
12215525a6020
13c4cc879530
1464dc17d46c
153639b2bda0
hex1e93f02e98

131331010200 has 192 divisors, whose sum is σ = 452587699200. Its totient is φ = 31284748800.

The previous prime is 131331010079. The next prime is 131331010207. The reversal of 131331010200 is 2010133131.

131331010200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a congruent number.

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

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

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

Almost surely, 2131331010200 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 54, while the sum is 15.

Adding to 131331010200 its reverse (2010133131), we get a palindrome (133341143331).

The spelling of 131331010200 in words is "one hundred thirty-one billion, three hundred thirty-one million, ten thousand, two hundred".