Search a number
-
+
100001101110000 = 2435410782937579
BaseRepresentation
bin10110101111001101010010…
…000110111101101011110000
3111010002000022200020201020120
4112233031102012331223300
5101101404223341010000
6552403512135210240
730030561336340416
oct2657152206755360
9433060280221216
10100001101110000
112995525760a442
12b270a72516980
1343a50a92c4c1c
141a9a11715d2b6
15b863d12c46a0
hex5af3521bdaf0

100001101110000 has 400 divisors, whose sum is σ = 326235593692800. Its totient is φ = 26385167232000.

The previous prime is 100001101109993. The next prime is 100001101110161. The reversal of 100001101110000 is 11101100001.

It is a tau number, because it is divible by the number of its divisors (400).

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 2661071211 + ... + 2661108789.

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

Almost surely, 2100001101110000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100001101110000 its reverse (11101100001), we get a palindrome (100012202210001).

Subtracting from 100001101110000 its reverse (11101100001), we obtain a palindrome (99990000009999).

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