Search a number
-
+
110000210100000 = 253551137198963
BaseRepresentation
bin11001000000101101101011…
…011100101011111100100000
3112102110220202202212222010120
4121000231223130223330200
5103404220412241200000
61025541222055000240
732112152515401153
oct3100555334537440
9472426682788116
10110000210100000
113205a9109a1460
121040693b969080
13494bc8a98399c
141d24077bd1c9a
15cab557db46a0
hex640b6b72bf20

110000210100000 has 576 divisors, whose sum is σ = 393875360363520. Its totient is φ = 26656572800000.

The previous prime is 110000210099977. The next prime is 110000210100017. The reversal of 110000210100000 is 1012000011.

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 (23) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 12272695519 + ... + 12272704481.

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

Almost surely, 2110000210100000 is an apocalyptic number.

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

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

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

110000210100000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

Adding to 110000210100000 its reverse (1012000011), we get a palindrome (110001222100011).

The spelling of 110000210100000 in words is "one hundred ten trillion, two hundred ten million, one hundred thousand".