Search a number
-
+
110002000101000 = 23353728318509507
BaseRepresentation
bin11001000000101111010110…
…001000111111111010001000
3112102111002101112002102212220
4121000233112020333322020
5103404233044011213000
61025542115440534040
732112245052222030
oct3100572610777210
9472432345072786
10110002000101000
113206064a346727
121040715b321320
13494c1b4782787
141d241a78248c0
15cab6100e51a0
hex640bd623fe88

110002000101000 has 256 divisors, whose sum is σ = 393621716367360. Its totient is φ = 25054467321600.

The previous prime is 110002000100987. The next prime is 110002000101001. The reversal of 110002000101000 is 101000200011.

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 self number, because there is not a number n which added to its sum of digits gives 110002000101000.

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

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 63 ways as a sum of consecutive naturals, for example, 3311754 + ... + 15197753.

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

Almost surely, 2110002000101000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110002000101000 its reverse (101000200011), we get a palindrome (110103000301011).

The spelling of 110002000101000 in words is "one hundred ten trillion, two billion, one hundred one thousand".