Search a number
-
+
110101010001000 = 23353379781101411
BaseRepresentation
bin11001000010001011100011…
…100101110010110001101000
3112102211112221200200111021020
4121002023203211302301220
5103412343332030013000
61030055412234412440
732122351444411434
oct3102134345626150
9472745850614236
10110101010001000
11320996378aaa67
1210422391591120
134958633110215
141d28cbb1939c4
15cadea7456ba0
hex6422e3972c68

110101010001000 has 256 divisors, whose sum is σ = 352838893605120. Its totient is φ = 28563546240000.

The previous prime is 110101010000987. The next prime is 110101010001133. The reversal of 110101010001000 is 100010101011.

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

It is an unprimeable number.

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

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

Almost surely, 2110101010001000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110101010001000 its reverse (100010101011), we get a palindrome (110201020102011).

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