Base | Representation |
---|---|
bin | 10110111111001110101100… |
… | …000100101110110111001101 |
3 | 111020222021020201111021000000 |
4 | 112333032230010232313031 |
5 | 101222424121224232341 |
6 | 555005401304154513 |
7 | 30203246556346602 |
oct | 2677165404566715 |
9 | 436867221437000 |
10 | 101102122102221 |
11 | 2a23a195221a59 |
12 | b40a328168a39 |
13 | 4454b7377a2b6 |
14 | 1ad752407a6a9 |
15 | ba4d717018b6 |
hex | 5bf3ac12edcd |
101102122102221 has 56 divisors (see below), whose sum is σ = 163276844069376. Its totient is φ = 62391211074720.
The previous prime is 101102122102049. The next prime is 101102122102231. The reversal of 101102122102221 is 122201221201101.
101102122102221 is a `hidden beast` number, since 10 + 1 + 10 + 212 + 210 + 2 + 221 = 666.
It is not a de Polignac number, because 101102122102221 - 29 = 101102122101709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101102122102194 and 101102122102203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101102122102231) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 96735510 + ... + 97775063.
Almost surely, 2101102122102221 is an apocalyptic number.
It is an amenable number.
101102122102221 is a deficient number, since it is larger than the sum of its proper divisors (62174721967155).
101102122102221 is an equidigital number, since it uses as much as digits as its factorization.
101102122102221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194510645 (or 194510630 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 101102122102221 its reverse (122201221201101), we get a palindrome (223303343303322).
The spelling of 101102122102221 in words is "one hundred one trillion, one hundred two billion, one hundred twenty-two million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.210 sec. • engine limits •