Base | Representation |
---|---|
bin | 10000000001011110110… |
… | …010110101001010001101 |
3 | 10220021010200200201122202 |
4 | 100001132302311022031 |
5 | 121020024103323041 |
6 | 2201501141251245 |
7 | 142360222444445 |
oct | 20013662651215 |
9 | 3807120621582 |
10 | 1101102011021 |
11 | 394a7a41a201 |
12 | 159498a03b25 |
13 | 7caab1b13bc |
14 | 3b4179ab125 |
15 | 1d9975d2a9b |
hex | 1005ecb528d |
1101102011021 has 4 divisors (see below), whose sum is σ = 1102182583200. Its totient is φ = 1100021438844.
The previous prime is 1101102011011. The next prime is 1101102011047. The reversal of 1101102011021 is 1201102011011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101102011021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101102010993 and 1101102011011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101102011011) 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, 540284561 + ... + 540286598.
It is an arithmetic number, because the mean of its divisors is an integer number (275545645800).
Almost surely, 21101102011021 is an apocalyptic number.
It is an amenable number.
1101102011021 is a deficient number, since it is larger than the sum of its proper divisors (1080572179).
1101102011021 is a wasteful number, since it uses less digits than its factorization.
1101102011021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1080572178.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1101102011021 its reverse (1201102011011), we get a palindrome (2302204022032).
The spelling of 1101102011021 in words is "one trillion, one hundred one billion, one hundred two million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •