Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …100100111111000000011 |
3 | 10220100202000200101210011 |
4 | 100002122330213320003 |
5 | 121024110432223021 |
6 | 2202145232045351 |
7 | 142424225503456 |
oct | 20023274477003 |
9 | 3810660611704 |
10 | 1102111211011 |
11 | 395448057088 |
12 | 15971a993857 |
13 | 7cc0c2bcc65 |
14 | 3b4b1a3149d |
15 | 1da05ecede1 |
hex | 1009af27e03 |
1102111211011 has 4 divisors (see below), whose sum is σ = 1102126485672. Its totient is φ = 1102095936352.
The previous prime is 1102111210999. The next prime is 1102111211107. The reversal of 1102111211011 is 1101121112011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1102111211011 - 25 = 1102111210979 is a prime.
It is a super-2 number, since 2×11021112110112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102111210982 and 1102111211000.
It is not an unprimeable number, because it can be changed into a prime (1102111211111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7528585 + ... + 7673578.
It is an arithmetic number, because the mean of its divisors is an integer number (275531621418).
Almost surely, 21102111211011 is an apocalyptic number.
1102111211011 is a deficient number, since it is larger than the sum of its proper divisors (15274661).
1102111211011 is an equidigital number, since it uses as much as digits as its factorization.
1102111211011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15274660.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1102111211011 its reverse (1101121112011), we get a palindrome (2203232323022).
The spelling of 1102111211011 in words is "one trillion, one hundred two billion, one hundred eleven million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •