Base | Representation |
---|---|
bin | 10000000010011011100… |
… | …010010110101010111011 |
3 | 10220100202201021220200111 |
4 | 100002123202112222323 |
5 | 121024121000231021 |
6 | 2202150224045151 |
7 | 142424405540266 |
oct | 20023342265273 |
9 | 3810681256614 |
10 | 1102121102011 |
11 | 3954526a2366 |
12 | 1597221637b7 |
13 | 7cc11374017 |
14 | 3b4b3087cdd |
15 | 1da06cd58e1 |
hex | 1009b896abb |
1102121102011 has 4 divisors (see below), whose sum is σ = 1102127189032. Its totient is φ = 1102115014992.
The previous prime is 1102121101997. The next prime is 1102121102023. The reversal of 1102121102011 is 1102011212011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1102121102011 - 25 = 1102121101979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102121101982 and 1102121102000.
It is not an unprimeable number, because it can be changed into a prime (1102121100011) 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 3 ways as a sum of consecutive naturals, for example, 2763321 + ... + 3136906.
It is an arithmetic number, because the mean of its divisors is an integer number (275531797258).
Almost surely, 21102121102011 is an apocalyptic number.
1102121102011 is a deficient number, since it is larger than the sum of its proper divisors (6087021).
1102121102011 is an equidigital number, since it uses as much as digits as its factorization.
1102121102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6087020.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1102121102011 its reverse (1102011212011), we get a palindrome (2204132314022).
The spelling of 1102121102011 in words is "one trillion, one hundred two billion, one hundred twenty-one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •