Base | Representation |
---|---|
bin | 11101110011110000011010… |
… | …001011101100001001101101 |
3 | 122012012001001212121201212102 |
4 | 131303300122023230021231 |
5 | 114140420320334441044 |
6 | 1142454303533544445 |
7 | 36420443510103614 |
oct | 3563603213541155 |
9 | 565161055551772 |
10 | 131100021015149 |
11 | 3885523010220a |
12 | 1285408b945125 |
13 | 581c8a980a954 |
14 | 24533bc37687b |
15 | 102532bceb24e |
hex | 773c1a2ec26d |
131100021015149 has 2 divisors, whose sum is σ = 131100021015150. Its totient is φ = 131100021015148.
The previous prime is 131100021015143. The next prime is 131100021015167. The reversal of 131100021015149 is 941510120001131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86179101892900 + 44920919122249 = 9283270^2 + 6702307^2 .
It is a cyclic number.
It is not a de Polignac number, because 131100021015149 - 228 = 131099752579693 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131100021015143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65550010507574 + 65550010507575.
It is an arithmetic number, because the mean of its divisors is an integer number (65550010507575).
Almost surely, 2131100021015149 is an apocalyptic number.
It is an amenable number.
131100021015149 is a deficient number, since it is larger than the sum of its proper divisors (1).
131100021015149 is an equidigital number, since it uses as much as digits as its factorization.
131100021015149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 29.
The spelling of 131100021015149 in words is "one hundred thirty-one trillion, one hundred billion, twenty-one million, fifteen thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •