Search a number
-
+
11110100000000 = 2858241461
BaseRepresentation
bin1010000110101100010110…
…0100000101110100000000
31110100010002222020011220012
42201223011210011310000
52424011441100000000
635343524240404052
72224451430556061
oct241530544056400
943303088204805
1011110100000000
1135a38488a0551
1212b5266016628
136278a7564751
142a5a35b4a568
15143eec456735
hexa1ac5905d00

11110100000000 has 324 divisors, whose sum is σ = 27896393920164. Its totient is φ = 4416000000000.

The previous prime is 11110099999991. The next prime is 11110100000009. The reversal of 11110100000000 is 101111.

It is an interprime number because it is at equal distance from previous prime (11110099999991) and next prime (11110100000009).

It can be written as a sum of positive squares in 18 ways, for example, as 723969546496 + 10386130453504 = 850864^2 + 3222752^2 .

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

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

It is a congruent number.

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

It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 24099999770 + ... + 24100000230.

Almost surely, 211110100000000 is an apocalyptic number.

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

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

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

11110100000000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 11110100000000 its reverse (101111), we get a palindrome (11110100101111).

The spelling of 11110100000000 in words is "eleven trillion, one hundred ten billion, one hundred million", and thus it is an aban number.