Base | Representation |
---|---|
bin | 1010000110001110100111… |
… | …1111000000101100010101 |
3 | 1110022100111220112011122012 |
4 | 2201203221333000230111 |
5 | 2423344121000231401 |
6 | 35340124413114005 |
7 | 2224046624215061 |
oct | 241435177005425 |
9 | 43270456464565 |
10 | 11102121102101 |
11 | 35a0423a26457 |
12 | 12b37b9a88905 |
13 | 626c054cc5a3 |
14 | 2a54ba1b6aa1 |
15 | 143bd1c288bb |
hex | a18e9fc0b15 |
11102121102101 has 2 divisors, whose sum is σ = 11102121102102. Its totient is φ = 11102121102100.
The previous prime is 11102121102097. The next prime is 11102121102139. The reversal of 11102121102101 is 10120112120111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6325230030001 + 4776891072100 = 2515001^2 + 2185610^2 .
It is a cyclic number.
It is not a de Polignac number, because 11102121102101 - 22 = 11102121102097 is a prime.
It is a super-2 number, since 2×111021211021012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11102121102001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551060551050 + 5551060551051.
It is an arithmetic number, because the mean of its divisors is an integer number (5551060551051).
Almost surely, 211102121102101 is an apocalyptic number.
It is an amenable number.
11102121102101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102121102101 is an equidigital number, since it uses as much as digits as its factorization.
11102121102101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11102121102101 its reverse (10120112120111), we get a palindrome (21222233222212).
The spelling of 11102121102101 in words is "eleven trillion, one hundred two billion, one hundred twenty-one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •