Base | Representation |
---|---|
bin | 10000000010011011000… |
… | …000000110010011110101 |
3 | 10220100202002101200120020 |
4 | 100002123000012103311 |
5 | 121024111200401401 |
6 | 2202145303355353 |
7 | 142424236316634 |
oct | 20023300062365 |
9 | 3810662350506 |
10 | 1102112122101 |
11 | 395448619651 |
12 | 15971b152b59 |
13 | 7cc0c54b873 |
14 | 3b4b1bcb51b |
15 | 1da0610ed36 |
hex | 1009b0064f5 |
1102112122101 has 16 divisors (see below), whose sum is σ = 1472151021696. Its totient is φ = 733408312896.
The previous prime is 1102112122099. The next prime is 1102112122103. The reversal of 1102112122101 is 1012212112011.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1102112122099) and next prime (1102112122103).
It is not a de Polignac number, because 1102112122101 - 21 = 1102112122099 is a prime.
It is a super-2 number, since 2×11021121221012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102112122103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4359696 + ... + 4605558.
It is an arithmetic number, because the mean of its divisors is an integer number (92009438856).
Almost surely, 21102112122101 is an apocalyptic number.
It is an amenable number.
1102112122101 is a deficient number, since it is larger than the sum of its proper divisors (370038899595).
1102112122101 is a wasteful number, since it uses less digits than its factorization.
1102112122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248572.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1102112122101 its reverse (1012212112011), we get a palindrome (2114324234112).
The spelling of 1102112122101 in words is "one trillion, one hundred two billion, one hundred twelve million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •