Search a number
-
+
110001011010000 = 24354113110752787
BaseRepresentation
bin11001000000101110011011…
…001011111010100111010000
3112102110222211120221102002220
4121000232123023322213100
5103404224032304310000
61025541433345141040
732112211412124555
oct3100563313724720
9472428746842086
10110001011010000
1132060191aa3a50
1210406b2402a780
13494c087894b26
141d24112316a2c
15cab5a336b1a0
hex640b9b2fa9d0

110001011010000 has 400 divisors, whose sum is σ = 399875712411648. Its totient is φ = 25806686400000.

The previous prime is 110001011009987. The next prime is 110001011010017. The reversal of 110001011010000 is 10110100011.

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 pernicious number, because its binary representation contains a prime number (23) of ones.

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

Almost surely, 2110001011010000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110001011010000 its reverse (10110100011), we get a palindrome (110011121110011).

It can be divided in two parts, 1 and 10001011010000, that added together give a palindrome (10001011010001).

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