Base | Representation |
---|---|
bin | 10000000010011010010… |
… | …010101100100011000101 |
3 | 10220100201021000000002102 |
4 | 100002122102230203011 |
5 | 121024100124020401 |
6 | 2202144200321445 |
7 | 142424033206136 |
oct | 20023222544305 |
9 | 3810637000072 |
10 | 1102100220101 |
11 | 39544192a491 |
12 | 159717173285 |
13 | 7cc09c4236a |
14 | 3b4b03adc8d |
15 | 1da0505d56b |
hex | 1009a4ac8c5 |
1102100220101 has 8 divisors (see below), whose sum is σ = 1103292046584. Its totient is φ = 1100909030080.
The previous prime is 1102100220077. The next prime is 1102100220107. The reversal of 1102100220101 is 1010220012011.
It can be written as a sum of positive squares in 4 ways, for example, as 65318069476 + 1036782150625 = 255574^2 + 1018225^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1102100220101 - 214 = 1102100203717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102100220107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3347591 + ... + 3662043.
It is an arithmetic number, because the mean of its divisors is an integer number (137911505823).
Almost surely, 21102100220101 is an apocalyptic number.
It is an amenable number.
1102100220101 is a deficient number, since it is larger than the sum of its proper divisors (1191826483).
1102100220101 is a wasteful number, since it uses less digits than its factorization.
1102100220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318231.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1102100220101 its reverse (1010220012011), we get a palindrome (2112320232112).
The spelling of 1102100220101 in words is "one trillion, one hundred two billion, one hundred million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •