Search a number
-
+
11010310000 = 245419167347
BaseRepresentation
bin10100100000100001…
…11111111101110000
31001102022211200220021
422100100333331300
5140022114410000
65020313053224
7536563043104
oct122020777560
931368750807
1011010310000
11474003a958
1221733b7214
1310660c7341
147663d5904
1544692911a
hex29043ff70

11010310000 has 200 divisors, whose sum is σ = 28309438080. Its totient is φ = 4135392000.

The previous prime is 11010309997. The next prime is 11010310001. The reversal of 11010310000 is 1301011.

It is a happy number.

11010310000 is digitally balanced in base 2, 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 (200).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11010310001) 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 39 ways as a sum of consecutive naturals, for example, 31729827 + ... + 31730173.

Almost surely, 211010310000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 11010310000 its reverse (1301011), we get a palindrome (11011611011).

The spelling of 11010310000 in words is "eleven billion, ten million, three hundred ten thousand".