Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …100101101010001010111 |
3 | 10220100202000201112002200 |
4 | 100002122330231101113 |
5 | 121024110433424421 |
6 | 2202145232335543 |
7 | 142424225625060 |
oct | 20023274552127 |
9 | 3810660645080 |
10 | 1102111233111 |
11 | 395448071749 |
12 | 15971a9a45b3 |
13 | 7cc0c2ca035 |
14 | 3b4b1a39567 |
15 | 1da05ed6726 |
hex | 1009af2d457 |
1102111233111 has 12 divisors (see below), whose sum is σ = 1819358226192. Its totient is φ = 629777847456.
The previous prime is 1102111233109. The next prime is 1102111233133. The reversal of 1102111233111 is 1113321112011.
1102111233111 is a `hidden beast` number, since 110 + 211 + 1 + 2 + 331 + 11 = 666.
It is not a de Polignac number, because 1102111233111 - 21 = 1102111233109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102111233101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8746914486 + ... + 8746914611.
It is an arithmetic number, because the mean of its divisors is an integer number (151613185516).
Almost surely, 21102111233111 is an apocalyptic number.
1102111233111 is a deficient number, since it is larger than the sum of its proper divisors (717246993081).
1102111233111 is a wasteful number, since it uses less digits than its factorization.
1102111233111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17493829110 (or 17493829107 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 1102111233111 its reverse (1113321112011), we get a palindrome (2215432345122).
The spelling of 1102111233111 in words is "one trillion, one hundred two billion, one hundred eleven million, two hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •