Search a number
-
+
10100110000000 = 27573121051
BaseRepresentation
bin1001001011111001110101…
…1101111111111110000000
31022202120011000212011201011
42102332131131333332000
52310440011130000000
633251532041450304
72061465066324436
oct222763535777600
938676130764634
1010100110000000
113244483870809
1211715764a0994
135835896a0307
1426cbc2a24d56
15127ad8b5a2ba
hex92f9d77ff80

10100110000000 has 384 divisors, whose sum is σ = 26013818170080. Its totient is φ = 3906000000000.

The previous prime is 10100109999989. The next prime is 10100110000037. The reversal of 10100110000000 is 1100101.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9609999475 + ... + 9610000525.

Almost surely, 210100110000000 is an apocalyptic number.

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

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

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

10100110000000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 10100110000000 its reverse (1100101), we get a palindrome (10100111100101).

The spelling of 10100110000000 in words is "ten trillion, one hundred billion, one hundred ten million", and thus it is an aban number.