Base | Representation |
---|---|
bin | 1001001100100010110111… |
… | …0010000000110110111101 |
3 | 1022210121120102012000120212 |
4 | 2103020231302000312331 |
5 | 2311130034000201341 |
6 | 33300552423522205 |
7 | 2062335002201441 |
oct | 223105562006675 |
9 | 38717512160525 |
10 | 10111121100221 |
11 | 32491142a0339 |
12 | 1173729bb9365 |
13 | 5846229b322b |
14 | 26d549184821 |
15 | 12803068d5eb |
hex | 9322dc80dbd |
10111121100221 has 2 divisors, whose sum is σ = 10111121100222. Its totient is φ = 10111121100220.
The previous prime is 10111121100193. The next prime is 10111121100251. The reversal of 10111121100221 is 12200112111101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9284903728996 + 826217371225 = 3047114^2 + 908965^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10111121100221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111121100196 and 10111121100205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111121100251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055560550110 + 5055560550111.
It is an arithmetic number, because the mean of its divisors is an integer number (5055560550111).
Almost surely, 210111121100221 is an apocalyptic number.
It is an amenable number.
10111121100221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111121100221 is an equidigital number, since it uses as much as digits as its factorization.
10111121100221 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 10111121100221 its reverse (12200112111101), we get a palindrome (22311233211322).
The spelling of 10111121100221 in words is "ten trillion, one hundred eleven billion, one hundred twenty-one million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •