Search a number
-
+
110011100010000 = 2435473731371069
BaseRepresentation
bin11001000000110111110100…
…100010011001011000010000
3112102111221212201011201021120
4121000313310202121120100
5103404410213100310000
61025550222431322240
732113016420166000
oct3100676442313020
9472457781151246
10110011100010000
1132064499a76a82
1210408a7a980380
134950004b44007
141d247cc206000
15cab993e596a0
hex640df4899610

110011100010000 has 1600 divisors, whose sum is σ = 423279557184000. Its totient is φ = 24596877312000.

The previous prime is 110011100009903. The next prime is 110011100010041. The reversal of 110011100010000 is 10001110011.

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 an unprimeable number.

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

It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 102910289466 + ... + 102910290534.

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

Almost surely, 2110011100010000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110011100010000 its reverse (10001110011), we get a palindrome (110021101120011).

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