Search a number
-
+
110211020101000 = 235371341271109001
BaseRepresentation
bin11001000011110010000000…
…101101000001010110001000
3112110020001220111002121020101
4121003302000231001112020
5103421144132121213000
61030222124344535144
732133324551006110
oct3103620055012610
9473201814077211
10110211020101000
113213125a719385
121043b7737814b4
134965b15735350
141d30355846040
15cb1c95396e6a
hex643c80b41588

110211020101000 has 512 divisors, whose sum is σ = 326352197283840. Its totient is φ = 33903360000000.

The previous prime is 110211020100983. The next prime is 110211020101003. The reversal of 110211020101000 is 101020112011.

It is a Harshad number since it is a multiple of its sum of digits (10).

It is not an unprimeable number, because it can be changed into a prime (110211020101003) by changing a digit.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1011046500 + ... + 1011155500.

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

Almost surely, 2110211020101000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 4, while the sum is 10.

Adding to 110211020101000 its reverse (101020112011), we get a palindrome (110312040213011).

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