Search a number
-
+
110110100001000 = 233531118771777661
BaseRepresentation
bin11001000010010100000001…
…011001011001000011101000
3112102212102102012010100001220
4121002110001121121003220
5103413020441100013000
61030103514232542040
732123122632215241
oct3102240131310350
9472772365110056
10110110100001000
11320a2481982560
12104240a9851920
134959451412448
141d29500515cc8
15cae33a4b01a0
hex6425016590e8

110110100001000 has 256 divisors, whose sum is σ = 374974618187520. Its totient is φ = 26679121280000.

The previous prime is 110110100000987. The next prime is 110110100001001. The reversal of 110110100001000 is 100001011011.

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 110110100001000.

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

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 61052170 + ... + 62829830.

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

Almost surely, 2110110100001000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110110100001000 its reverse (100001011011), we get a palindrome (110210101012011).

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