Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …000100101110100011111 |
3 | 10220100110100111021202202 |
4 | 100002110120211310133 |
5 | 121023344240231421 |
6 | 2202130300042115 |
7 | 142421420546330 |
oct | 20022430456437 |
9 | 3810410437682 |
10 | 1102001102111 |
11 | 3953a0990698 |
12 | 1596a9b3333b |
13 | 7cbc254a170 |
14 | 3b4a116c287 |
15 | 1d9eb4d010b |
hex | 10094625d1f |
1102001102111 has 32 divisors (see below), whose sum is σ = 1359956304000. Its totient is φ = 869570150400.
The previous prime is 1102001102089. The next prime is 1102001102129. The reversal of 1102001102111 is 1112011002011.
It is not a de Polignac number, because 1102001102111 - 26 = 1102001102047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102001102092 and 1102001102101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102001102711) 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 31 ways as a sum of consecutive naturals, for example, 114441245 + ... + 114450873.
It is an arithmetic number, because the mean of its divisors is an integer number (42498634500).
Almost surely, 21102001102111 is an apocalyptic number.
1102001102111 is a deficient number, since it is larger than the sum of its proper divisors (257955201889).
1102001102111 is a wasteful number, since it uses less digits than its factorization.
1102001102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12899.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1102001102111 its reverse (1112011002011), we get a palindrome (2214012104122).
The spelling of 1102001102111 in words is "one trillion, one hundred two billion, one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •