Search a number
-
+
110210010001000 = 23537132056358897
BaseRepresentation
bin11001000011110001000100…
…011111110010111001101000
3112110012222022002102012112021
4121003301010133302321220
5103421140100030013000
61030221440222554224
732133260534211130
oct3103610437627150
9473188262365467
10110210010001000
1132130891527298
121043b531438974
1349659b439cc40
141d3029b629ac0
15cb1c3686d11a
hex643c447f2e68

110210010001000 has 256 divisors, whose sum is σ = 317425653941760. Its totient is φ = 34877363097600.

The previous prime is 110210010000943. The next prime is 110210010001009. The reversal of 110210010001000 is 100010012011.

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

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

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

Almost surely, 2110210010001000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110210010001000 its reverse (100010012011), we get a palindrome (110310020013011).

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