Search a number
-
+
10011012001100 = 225211737913711519
BaseRepresentation
bin1001000110101101111011…
…0100000110110101001100
31022110001011122020212110222
42101223132310012311030
52303010023033013400
633142555002250512
72052162131662625
oct221533664066514
938401148225428
1010011012001100
11320a712319480
12115824b7b6a38
1357805a6c54c6
1426876d844a4c
15125621aa3185
hex91aded06d4c

10011012001100 has 288 divisors, whose sum is σ = 24507231436800. Its totient is φ = 3518868787200.

The previous prime is 10011012001037. The next prime is 10011012001103. The reversal of 10011012001100 is 110021011001.

It is a happy number.

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

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

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 869081141 + ... + 869092659.

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

Almost surely, 210011012001100 is an apocalyptic number.

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

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

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

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

10011012001100 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 10011012001100 its reverse (110021011001), we get a palindrome (10121033012101).

Subtracting from 10011012001100 its reverse (110021011001), we obtain a palindrome (9900990990099).

It can be divided in two parts, 1001 and 1012001100, that added together give a palindrome (1012002101).

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