Search a number
-
+
10131113212000 = 2553111743314983
BaseRepresentation
bin1001001101101101010101…
…1001110111100001100000
31022212112011200212112020021
42103123111121313201200
52311442004440241000
633314100312123224
72063643300302554
oct223332531674140
938775150775207
1010131113212000
113256643321870
121177589396514
1358648a858581
142704c43b5864
1512880089c11a
hex936d5677860

10131113212000 has 384 divisors, whose sum is σ = 29421178795008. Its totient is φ = 3386686464000.

The previous prime is 10131113211997. The next prime is 10131113212007. The reversal of 10131113212000 is 21231113101.

It is a happy number.

10131113212000 is digitally balanced in base 2, 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 (16).

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 32006509 + ... + 32321491.

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

Almost surely, 210131113212000 is an apocalyptic number.

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

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

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

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

10131113212000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 36, while the sum is 16.

Adding to 10131113212000 its reverse (21231113101), we get a palindrome (10152344325101).

The spelling of 10131113212000 in words is "ten trillion, one hundred thirty-one billion, one hundred thirteen million, two hundred twelve thousand".