Base | Representation |
---|---|
bin | 10110101111001100010000… |
… | …100011001001001111010110 |
3 | 111010001220111000120112220021 |
4 | 112233030100203021033112 |
5 | 101101400000301413420 |
6 | 552403211044255354 |
7 | 30030522152304103 |
oct | 2657142043111726 |
9 | 433056430515807 |
10 | 100000001201110 |
11 | 2995484275762a |
12 | b2708060a155a |
13 | 43a4c6247686a |
14 | 1a9a051045aaa |
15 | b8636995a7aa |
hex | 5af3108c93d6 |
100000001201110 has 16 divisors (see below), whose sum is σ = 190588237583616. Its totient is φ = 37647059275648.
The previous prime is 100000001201101. The next prime is 100000001201143. The reversal of 100000001201110 is 11102100000001.
It is a junction number, because it is equal to n+sod(n) for n = 100000001201093 and 100000001201102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 294117650422 + ... + 294117650761.
It is an arithmetic number, because the mean of its divisors is an integer number (11911764848976).
Almost surely, 2100000001201110 is an apocalyptic number.
100000001201110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100000001201110 is a deficient number, since it is larger than the sum of its proper divisors (90588236382506).
100000001201110 is a wasteful number, since it uses less digits than its factorization.
100000001201110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 588235301207.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 100000001201110 its reverse (11102100000001), we get a palindrome (111102101201111).
The spelling of 100000001201110 in words is "one hundred trillion, one million, two hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •