Search a number
-
+
10100100110100 = 2235271113891093467
BaseRepresentation
bin1001001011111001110011…
…1000010001011100010100
31022202120010100020201022120
42102332130320101130110
52310440001112010400
633251531045455540
72061464616264060
oct222763470213424
938676110221276
1010100100110100
113244479226340
1211715731115b0
135835876198c0
1426cbc15acaa0
15127ad7d54ca0
hex92f9ce11714

10100100110100 has 1152 divisors, whose sum is σ = 40052836454400. Its totient is φ = 1897393766400.

The previous prime is 10100100110069. The next prime is 10100100110123. The reversal of 10100100110100 is 101100100101.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 2913208567 + ... + 2913212033.

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

Almost surely, 210100100110100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 10100100110100 its reverse (101100100101), we get a palindrome (10201200210201).

Subtracting from 10100100110100 its reverse (101100100101), we obtain a palindrome (9999000009999).

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