Search a number
-
+
110030310000 = 24325413157599
BaseRepresentation
bin110011001111001010…
…0010100101001110000
3101112000012102212212200
41212132110110221300
53300320224410000
6122314111223200
710643440126542
oct1463624245160
9345005385780
10110030310000
11427332724a6
12193a8b17b00
13a4b6880010
14547b233692
152cdead3500
hex199e514a70

110030310000 has 600 divisors, whose sum is σ = 417726909600. Its totient is φ = 26866944000.

The previous prime is 110030309927. The next prime is 110030310053. The reversal of 110030310000 is 13030011.

110030310000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a tau number, because it is divible by the number of its divisors (600).

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

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

It is a congruent number.

It is an unprimeable number.

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 119 ways as a sum of consecutive naturals, for example, 183689701 + ... + 183690299.

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

Almost surely, 2110030310000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110030310000 its reverse (13030011), we get a palindrome (110043340011).

The spelling of 110030310000 in words is "one hundred ten billion, thirty million, three hundred ten thousand".