Base | Representation |
---|---|
bin | 1001001100100010110010… |
… | …0101101110100000101001 |
3 | 1022210121112000120000100111 |
4 | 2103020230211232200221 |
5 | 2311130013340231441 |
6 | 33300550431134321 |
7 | 2062334340211105 |
oct | 223105445564051 |
9 | 38717460500314 |
10 | 10111101102121 |
11 | 3249103a81488 |
12 | 11737233743a1 |
13 | 58461b800936 |
14 | 26d54665a905 |
15 | 12802da3d081 |
hex | 9322c96e829 |
10111101102121 has 2 divisors, whose sum is σ = 10111101102122. Its totient is φ = 10111101102120.
The previous prime is 10111101102103. The next prime is 10111101102143. The reversal of 10111101102121 is 12120110111101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9036486905625 + 1074614196496 = 3006075^2 + 1036636^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10111101102121 is a prime.
It is not a weakly prime, because it can be changed into another prime (10111101102161) 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, 5055550551060 + 5055550551061.
It is an arithmetic number, because the mean of its divisors is an integer number (5055550551061).
Almost surely, 210111101102121 is an apocalyptic number.
It is an amenable number.
10111101102121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111101102121 is an equidigital number, since it uses as much as digits as its factorization.
10111101102121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 10111101102121 its reverse (12120110111101), we get a palindrome (22231211213222).
The spelling of 10111101102121 in words is "ten trillion, one hundred eleven billion, one hundred one million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •