Base | Representation |
---|---|
bin | 10000000010011011100… |
… | …101110111000010010011 |
3 | 10220100202210000121022112 |
4 | 100002123211313002103 |
5 | 121024121214133021 |
6 | 2202150255455535 |
7 | 142424416415504 |
oct | 20023345670223 |
9 | 3810683017275 |
10 | 1102122021011 |
11 | 39545316a870 |
12 | 1597225275ab |
13 | 7cc116063cb |
14 | 3b4b3246bab |
15 | 1da06e17d5b |
hex | 1009b977093 |
1102122021011 has 8 divisors (see below), whose sum is σ = 1203538051584. Its totient is φ = 1000909843720.
The previous prime is 1102122020977. The next prime is 1102122021131. The reversal of 1102122021011 is 1101202212011.
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 1102122021011 - 222 = 1102117826707 is a prime.
It is a super-2 number, since 2×11021220210112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1102122029011) 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, 50952011 + ... + 50973636.
It is an arithmetic number, because the mean of its divisors is an integer number (150442256448).
Almost surely, 21102122021011 is an apocalyptic number.
1102122021011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1102122021011 is a deficient number, since it is larger than the sum of its proper divisors (101416030573).
1102122021011 is a wasteful number, since it uses less digits than its factorization.
1102122021011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101926641.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1102122021011 its reverse (1101202212011), we get a palindrome (2203324233022).
The spelling of 1102122021011 in words is "one trillion, one hundred two billion, one hundred twenty-two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •