Search a number
-
+
10100000112111 = 327131923371515051
BaseRepresentation
bin1001001011111001011011…
…1010110011110111101111
31022202112212101002021212100
42102332112322303313233
52310434300012041421
633251513114310143
72061462263310540
oct222762672636757
938675771067770
1010100000112111
113244427836378
121171545728353
1358356c9a6cb0
1426cbb21bc4c7
15127ace1a0c26
hex92f96eb3def

10100000112111 has 384 divisors, whose sum is σ = 20393564405760. Its totient is φ = 4665133440000.

The previous prime is 10100000112079. The next prime is 10100000112113. The reversal of 10100000112111 is 11121100000101.

It is not a de Polignac number, because 10100000112111 - 25 = 10100000112079 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10100000112093 and 10100000112102.

It is a congruent number.

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

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

It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 1999601536 + ... + 1999606586.

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

Almost surely, 210100000112111 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 10100000112111 its reverse (11121100000101), we get a palindrome (21221100112212).

The spelling of 10100000112111 in words is "ten trillion, one hundred billion, one hundred twelve thousand, one hundred eleven".