Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …1010011001010110000101 |
3 | 1022102221120220002110202012 |
4 | 2101222203022121112011 |
5 | 2303001000332224031 |
6 | 33142311412024005 |
7 | 2052125260261634 |
oct | 221524312312605 |
9 | 38387526073665 |
10 | 10010011211141 |
11 | 320a249406137 |
12 | 1158010602005 |
13 | 577c2b26c8b6 |
14 | 2686b696d51b |
15 | 1255b3cb7b2b |
hex | 91aa3299585 |
10010011211141 has 2 divisors, whose sum is σ = 10010011211142. Its totient is φ = 10010011211140.
The previous prime is 10010011211129. The next prime is 10010011211219. The reversal of 10010011211141 is 14111211001001.
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., 8912189238241 + 1097821972900 = 2985329^2 + 1047770^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10010011211141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10010011231141) 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, 5005005605570 + 5005005605571.
It is an arithmetic number, because the mean of its divisors is an integer number (5005005605571).
Almost surely, 210010011211141 is an apocalyptic number.
It is an amenable number.
10010011211141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010011211141 is an equidigital number, since it uses as much as digits as its factorization.
10010011211141 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 10010011211141 its reverse (14111211001001), we get a palindrome (24121222212142).
The spelling of 10010011211141 in words is "ten trillion, ten billion, eleven million, two hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •