Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …100001101010010010101 |
3 | 10220100202000110212101110 |
4 | 100002122330031102111 |
5 | 121024110420231401 |
6 | 2202145225445233 |
7 | 142424224541112 |
oct | 20023274152225 |
9 | 3810660425343 |
10 | 1102111102101 |
11 | 395447a92279 |
12 | 15971a940819 |
13 | 7cc0c282509 |
14 | 3b4b1a03909 |
15 | 1da05eac9d6 |
hex | 1009af0d495 |
1102111102101 has 12 divisors (see below), whose sum is σ = 1550893186752. Its totient is φ = 696070169064.
The previous prime is 1102111102087. The next prime is 1102111102123. The reversal of 1102111102101 is 1012011112011.
It is a de Polignac number, because none of the positive numbers 2k-1102111102101 is a prime.
It is a super-2 number, since 2×11021111021012 (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 (1102111101101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 508822141 + ... + 508824306.
It is an arithmetic number, because the mean of its divisors is an integer number (129241098896).
Almost surely, 21102111102101 is an apocalyptic number.
It is an amenable number.
1102111102101 is a deficient number, since it is larger than the sum of its proper divisors (448782084651).
1102111102101 is a wasteful number, since it uses less digits than its factorization.
1102111102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017646488 (or 1017646469 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1102111102101 its reverse (1012011112011), we get a palindrome (2114122214112).
The spelling of 1102111102101 in words is "one trillion, one hundred two billion, one hundred eleven million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •