Base | Representation |
---|---|
bin | 100000110100001… |
… | …0111110000011111 |
3 | 2211201220210010200 |
4 | 1001220113300133 |
5 | 4223340231421 |
6 | 301132234543 |
7 | 36200133144 |
oct | 10150276037 |
9 | 2751823120 |
10 | 1101102111 |
11 | 5155a834a |
12 | 26890ba53 |
13 | 147178515 |
14 | a63483cb |
15 | 66a02726 |
hex | 41a17c1f |
1101102111 has 12 divisors (see below), whose sum is σ = 1596820680. Its totient is φ = 731142000.
The previous prime is 1101102049. The next prime is 1101102127. The reversal of 1101102111 is 1112011011.
It is not a de Polignac number, because 1101102111 - 218 = 1100839967 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1101102093 and 1101102102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101102311) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 241456 + ... + 245973.
It is an arithmetic number, because the mean of its divisors is an integer number (133068390).
Almost surely, 21101102111 is an apocalyptic number.
1101102111 is a deficient number, since it is larger than the sum of its proper divisors (495718569).
1101102111 is a wasteful number, since it uses less digits than its factorization.
1101102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487686 (or 487683 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
The square root of 1101102111 is about 33182.8586924032. The cubic root of 1101102111 is about 1032.6247541002.
Adding to 1101102111 its reverse (1112011011), we get a palindrome (2213113122).
It can be divided in two parts, 1101 and 102111, that multiplied together give a palindrome (112424211).
The spelling of 1101102111 in words is "one billion, one hundred one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •