Search a number
-
+
101110100200010 = 251124371270710111
BaseRepresentation
bin10110111111010110000111…
…100110110000101001001010
3111021000000211201200121201022
4112333112013212300221022
5101223041441122400020
6555013201102352442
730203651353146116
oct2677260746605112
9437000751617638
10101110100200010
112a24260969aa00
12b40b993b8b722
1344558455c2215
141ad7a7d882746
15ba518bd22625
hex5bf5879b0a4a

101110100200010 has 192 divisors, whose sum is σ = 207680174456832. Its totient is φ = 35389868976000.

The previous prime is 101110100200003. The next prime is 101110100200027. The reversal of 101110100200010 is 10002001011101.

It is a happy number.

It is an unprimeable number.

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

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

Almost surely, 2101110100200010 is an apocalyptic number.

101110100200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

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

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

Adding to 101110100200010 its reverse (10002001011101), we get a palindrome (111112101211111).

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