Base | Representation |
---|---|
bin | 10000000010100000111… |
… | …101100100010110011011 |
3 | 10220101000001120012122121 |
4 | 100002200331210112123 |
5 | 121024312300401021 |
6 | 2202203235002111 |
7 | 142426562311600 |
oct | 20024075442633 |
9 | 3811001505577 |
10 | 1102212122011 |
11 | 39549a010000 |
12 | 159748739337 |
13 | 7cc27192300 |
14 | 3b4c11bc6a7 |
15 | 1da0ecb4741 |
hex | 100a0f6459b |
1102212122011 has 90 divisors (see below), whose sum is σ = 1527376490460. Its totient is φ = 792712720800.
The previous prime is 1102212121981. The next prime is 1102212122017.
1102212122011 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1102212122011 - 213 = 1102212113819 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1102212122017) 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 89 ways as a sum of consecutive naturals, for example, 121237576 + ... + 121246666.
It is an arithmetic number, because the mean of its divisors is an integer number (16970849894).
Almost surely, 21102212122011 is an apocalyptic number.
1102212122011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1102212122011 is a deficient number, since it is larger than the sum of its proper divisors (425164368449).
1102212122011 is an frugal number, since it uses more digits than its factorization.
1102212122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9175 (or 9122 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
The spelling of 1102212122011 in words is "one trillion, one hundred two billion, two hundred twelve million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •