Search a number
-
+
110321230110 = 235713412713637
BaseRepresentation
bin110011010111110101…
…0000110000100011110
3101112202110212011020120
41212233222012010132
53301414213330420
6122403022455410
710653601661250
oct1465752060436
9345673764216
10110321230110
1142872505043
121946a434566
13a531c1bcb0
1454a7b21cd0
152d0a3ebd40
hex19afa8611e

110321230110 has 256 divisors, whose sum is σ = 335143968768. Its totient is φ = 22618828800.

The previous prime is 110321230073. The next prime is 110321230111. The reversal of 110321230110 is 11032123011.

It is a happy number.

It is a super-2 number, since 2×1103212301102 (a number of 23 digits) contains 22 as substring.

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

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 110321230110.

It is a congruent number.

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

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 127 ways as a sum of consecutive naturals, for example, 30331212 + ... + 30334848.

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

Almost surely, 2110321230110 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 110321230110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167571984384).

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

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

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

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

The sum of its prime factors is 3979.

The product of its (nonzero) digits is 36, while the sum is 15.

Adding to 110321230110 its reverse (11032123011), we get a palindrome (121353353121).

The spelling of 110321230110 in words is "one hundred ten billion, three hundred twenty-one million, two hundred thirty thousand, one hundred ten".