Base | Representation |
---|---|
bin | 111101000110110000… |
… | …0000110111001110101 |
3 | 110112201011021021002011 |
4 | 1322031200012321311 |
5 | 4122221043220341 |
6 | 140141044444221 |
7 | 12323554202503 |
oct | 1721540067165 |
9 | 415634237064 |
10 | 131223023221 |
11 | 50718a80624 |
12 | 215223a9671 |
13 | c4b339a504 |
14 | 64cbaad673 |
15 | 36303eab81 |
hex | 1e8d806e75 |
131223023221 has 2 divisors, whose sum is σ = 131223023222. Its totient is φ = 131223023220.
The previous prime is 131223023209. The next prime is 131223023227. The reversal of 131223023221 is 122320322131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114585635025 + 16637388196 = 338505^2 + 128986^2 .
It is a cyclic number.
It is not a de Polignac number, because 131223023221 - 29 = 131223022709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131223023192 and 131223023201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131223023227) 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, 65611511610 + 65611511611.
It is an arithmetic number, because the mean of its divisors is an integer number (65611511611).
Almost surely, 2131223023221 is an apocalyptic number.
It is an amenable number.
131223023221 is a deficient number, since it is larger than the sum of its proper divisors (1).
131223023221 is an equidigital number, since it uses as much as digits as its factorization.
131223023221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 131223023221 its reverse (122320322131), we get a palindrome (253543345352).
The spelling of 131223023221 in words is "one hundred thirty-one billion, two hundred twenty-three million, twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •