Base | Representation |
---|---|
bin | 11101110111000111100010… |
… | …010101001011010101101101 |
3 | 122020000010022001022100022021 |
4 | 131313013202111023111231 |
5 | 114203211403111241302 |
6 | 1143152344544550141 |
7 | 36443231624634466 |
oct | 3567074225132555 |
9 | 566003261270267 |
10 | 131331012212077 |
11 | 38934195668357 |
12 | 128909b6322351 |
13 | 58385cc669272 |
14 | 246065239bd6d |
15 | 102b34addc437 |
hex | 7771e254b56d |
131331012212077 has 2 divisors, whose sum is σ = 131331012212078. Its totient is φ = 131331012212076.
The previous prime is 131331012212011. The next prime is 131331012212111. The reversal of 131331012212077 is 770212210133131.
It is an a-pointer prime, because the next prime (131331012212111) can be obtained adding 131331012212077 to its sum of digits (34).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115014170985156 + 16316841226921 = 10724466^2 + 4039411^2 .
It is a cyclic number.
It is not a de Polignac number, because 131331012212077 - 223 = 131331003823469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131331012212977) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65665506106038 + 65665506106039.
It is an arithmetic number, because the mean of its divisors is an integer number (65665506106039).
Almost surely, 2131331012212077 is an apocalyptic number.
It is an amenable number.
131331012212077 is a deficient number, since it is larger than the sum of its proper divisors (1).
131331012212077 is an equidigital number, since it uses as much as digits as its factorization.
131331012212077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10584, while the sum is 34.
The spelling of 131331012212077 in words is "one hundred thirty-one trillion, three hundred thirty-one billion, twelve million, two hundred twelve thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •