Base | Representation |
---|---|
bin | 1111101000100… |
… | …11010100010001 |
3 | 100010210011111221 |
4 | 13310103110101 |
5 | 232033313441 |
6 | 21003005041 |
7 | 3151523533 |
oct | 764232421 |
9 | 303704457 |
10 | 131151121 |
11 | 68038862 |
12 | 37b09781 |
13 | 2122c71a |
14 | 135bd853 |
15 | b7a98d1 |
hex | 7d13511 |
131151121 has 2 divisors, whose sum is σ = 131151122. Its totient is φ = 131151120.
The previous prime is 131151071. The next prime is 131151133. The reversal of 131151121 is 121151131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71166096 + 59985025 = 8436^2 + 7745^2 .
It is a cyclic number.
It is not a de Polignac number, because 131151121 - 215 = 131118353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131151095 and 131151104.
It is not a weakly prime, because it can be changed into another prime (131151151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65575560 + 65575561.
It is an arithmetic number, because the mean of its divisors is an integer number (65575561).
Almost surely, 2131151121 is an apocalyptic number.
It is an amenable number.
131151121 is a deficient number, since it is larger than the sum of its proper divisors (1).
131151121 is an equidigital number, since it uses as much as digits as its factorization.
131151121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 30, while the sum is 16.
The square root of 131151121 is about 11452.1229909567. The cubic root of 131151121 is about 508.0705269742.
The spelling of 131151121 in words is "one hundred thirty-one million, one hundred fifty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •