Base | Representation |
---|---|
bin | 1010000000010110010011… |
… | …0010000110111100011101 |
3 | 1102221200202201110021110011 |
4 | 2200011210302012330131 |
5 | 2420220224114233201 |
6 | 35221500405243221 |
7 | 2213542364663503 |
oct | 240054462067435 |
9 | 42850681407404 |
10 | 11001102102301 |
11 | 35615a537a763 |
12 | 1298106a03511 |
13 | 61a52685c8ac |
14 | 2a0655aa0673 |
15 | 14126d308151 |
hex | a0164c86f1d |
11001102102301 has 2 divisors, whose sum is σ = 11001102102302. Its totient is φ = 11001102102300.
The previous prime is 11001102102271. The next prime is 11001102102401. The reversal of 11001102102301 is 10320120110011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6751942402500 + 4249159699801 = 2598450^2 + 2061349^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001102102301 - 211 = 11001102100253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001102102401) 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 as a sum of consecutive naturals, namely, 5500551051150 + 5500551051151.
It is an arithmetic number, because the mean of its divisors is an integer number (5500551051151).
Almost surely, 211001102102301 is an apocalyptic number.
It is an amenable number.
11001102102301 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001102102301 is an equidigital number, since it uses as much as digits as its factorization.
11001102102301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11001102102301 its reverse (10320120110011), we get a palindrome (21321222212312).
The spelling of 11001102102301 in words is "eleven trillion, one billion, one hundred two million, one hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •