Base | Representation |
---|---|
bin | 10110101111010110101101… |
… | …010011101010100111010011 |
3 | 111010002222102221210112002110 |
4 | 112233112231103222213103 |
5 | 101102040440100213021 |
6 | 552412304245520403 |
7 | 30031400202005403 |
oct | 2657265523524723 |
9 | 433088387715073 |
10 | 100011221101011 |
11 | 2995958002a480 |
12 | b272a17713103 |
13 | 43a602cb0519c |
14 | 1a9a7d71d8803 |
15 | b867c4985476 |
hex | 5af5ad4ea9d3 |
100011221101011 has 64 divisors (see below), whose sum is σ = 150902565350400. Its totient is φ = 58382710848000.
The previous prime is 100011221100949. The next prime is 100011221101027. The reversal of 100011221101011 is 110101122110001.
It is not a de Polignac number, because 100011221101011 - 217 = 100011220969939 is a prime.
It is a super-2 number, since 2×1000112211010112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100011221101411) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 960495210 + ... + 960599328.
It is an arithmetic number, because the mean of its divisors is an integer number (2357852583600).
Almost surely, 2100011221101011 is an apocalyptic number.
100011221101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100011221101011 is a deficient number, since it is larger than the sum of its proper divisors (50891344249389).
100011221101011 is a wasteful number, since it uses less digits than its factorization.
100011221101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112060.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 100011221101011 its reverse (110101122110001), we get a palindrome (210112343211012).
The spelling of 100011221101011 in words is "one hundred trillion, eleven billion, two hundred twenty-one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •