Search a number
-
+
100111011110010 = 232543163557328477
BaseRepresentation
bin10110110000110011101001…
…010000010101110001111010
3111010110112000111022012211200
4112300303221100111301322
5101110204322321010020
6552530210312035030
730041532116045265
oct2660635120256172
9433415014265750
10100111011110010
112999792897919a
12b28a227092a76
1343b2573c6cba4
141aa15823d5cdc
15b891b5540590
hex5b0ce9415c7a

100111011110010 has 192 divisors, whose sum is σ = 268033348522368. Its totient is φ = 25909894144512.

The previous prime is 100111011109997. The next prime is 100111011110027. The reversal of 100111011110010 is 10011110111001.

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 = 100111011109974 and 100111011110001.

It is an unprimeable number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 3515489892 + ... + 3515518368.

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

Almost surely, 2100111011110010 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 100111011110010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134016674261184).

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

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

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

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

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

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

Adding to 100111011110010 its reverse (10011110111001), we get a palindrome (110122121221011).

Subtracting from 100111011110010 its reverse (10011110111001), we obtain a palindrome (90099900999009).

It can be divided in two parts, 1001 and 11011110010, that added together give a palindrome (11011111011).

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