Base | Representation |
---|---|
bin | 111101001101010100… |
… | …0011100001001110101 |
3 | 110120021111210001101222 |
4 | 1322122220130021311 |
5 | 4123143441424341 |
6 | 140214554200125 |
7 | 12332200465535 |
oct | 1723250341165 |
9 | 416244701358 |
10 | 131443311221 |
11 | 50821360222 |
12 | 21584123045 |
13 | c519c09041 |
14 | 650d0534c5 |
15 | 364491144b |
hex | 1e9aa1c275 |
131443311221 has 2 divisors, whose sum is σ = 131443311222. Its totient is φ = 131443311220.
The previous prime is 131443311173. The next prime is 131443311229. The reversal of 131443311221 is 122113344131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66221302225 + 65222008996 = 257335^2 + 255386^2 .
It is an emirp because it is prime and its reverse (122113344131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131443311221 - 226 = 131376202357 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131443311229) 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, 65721655610 + 65721655611.
It is an arithmetic number, because the mean of its divisors is an integer number (65721655611).
Almost surely, 2131443311221 is an apocalyptic number.
It is an amenable number.
131443311221 is a deficient number, since it is larger than the sum of its proper divisors (1).
131443311221 is an equidigital number, since it uses as much as digits as its factorization.
131443311221 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1728, while the sum is 26.
Adding to 131443311221 its reverse (122113344131), we get a palindrome (253556655352).
The spelling of 131443311221 in words is "one hundred thirty-one billion, four hundred forty-three million, three hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •