Search a number
-
+
110100010011000 = 23353192383981701
BaseRepresentation
bin11001000010001010100111…
…111111001000100101111000
3112102211110101000000201212120
4121002022213333020211320
5103412334310030323000
61030055125113241240
732122314612551622
oct3102124777104570
9472743330021776
10110100010011000
1132099174393749
1210422152703220
134958503ba7769
141d28c24449c12
15cade497786a0
hex6422a7fc8978

110100010011000 has 256 divisors, whose sum is σ = 377312990745600. Its totient is φ = 26605402560000.

The previous prime is 110100010010971. The next prime is 110100010011001. The reversal of 110100010011000 is 110010001011.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110100010011001) 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, 40679851 + ... + 43301850.

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

Almost surely, 2110100010011000 is an apocalyptic number.

110100010011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

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

Adding to 110100010011000 its reverse (110010001011), we get a palindrome (110210020012011).

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