Search a number
-
+
10111111010000 = 24547111373101137
BaseRepresentation
bin1001001100100010110100…
…1011100001011011010000
31022210121112201012101101222
42103020231023201123100
52311130023404310000
633300551423344212
72062334520345050
oct223105513413320
938717481171358
1010111111010000
113249109629410
121173726752068
1358462088c5a0
1426d547ab9560
1512802e848a85
hex9322d2e16d0

10111111010000 has 1600 divisors, whose sum is σ = 33894011644416. Its totient is φ = 2820096000000.

The previous prime is 10111111009963. The next prime is 10111111010027. The reversal of 10111111010000 is 1011111101.

It is a super-3 number, since 3×101111110100003 (a number of 40 digits) contains 333 as substring.

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

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

It is a congruent number.

It is an unprimeable number.

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 319 ways as a sum of consecutive naturals, for example, 73803729932 + ... + 73803730068.

Almost surely, 210111111010000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 10111111010000 its reverse (1011111101), we get a palindrome (10112122121101).

10111111010000 divided by its reverse (1011111101) gives a 4-th power (10000 = 104).

It can be divided in two parts, 101111 and 11010000, that added together give a palindrome (11111111).

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