Base | Representation |
---|---|
bin | 11101110110101011110010… |
… | …000111100100101011001101 |
3 | 122012220021101020112110222112 |
4 | 131312223302013210223031 |
5 | 114202214340322411341 |
6 | 1143130535541353405 |
7 | 36441125304642242 |
oct | 3566536207445315 |
9 | 565807336473875 |
10 | 131301212310221 |
11 | 38922593373a98 |
12 | 1288707a408865 |
13 | 5835860894045 |
14 | 245d02675d5c9 |
15 | 102a6a4b3baeb |
hex | 776af21e4acd |
131301212310221 has 2 divisors, whose sum is σ = 131301212310222. Its totient is φ = 131301212310220.
The previous prime is 131301212310211. The next prime is 131301212310239. The reversal of 131301212310221 is 122013212103131.
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., 120020548141321 + 11280664168900 = 10955389^2 + 3358670^2 .
It is a cyclic number.
It is not a de Polignac number, because 131301212310221 - 218 = 131301212048077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131301212310211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65650606155110 + 65650606155111.
It is an arithmetic number, because the mean of its divisors is an integer number (65650606155111).
Almost surely, 2131301212310221 is an apocalyptic number.
It is an amenable number.
131301212310221 is a deficient number, since it is larger than the sum of its proper divisors (1).
131301212310221 is an equidigital number, since it uses as much as digits as its factorization.
131301212310221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 131301212310221 its reverse (122013212103131), we get a palindrome (253314424413352).
The spelling of 131301212310221 in words is "one hundred thirty-one trillion, three hundred one billion, two hundred twelve million, three hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •