Base | Representation |
---|---|
bin | 100111101010111… |
… | …0100100001101101 |
3 | 10102202201220200112 |
4 | 1033111310201231 |
5 | 10211231321422 |
6 | 340030305405 |
7 | 44662223006 |
oct | 11725644155 |
9 | 3382656615 |
10 | 1331120237 |
11 | 623423377 |
12 | 311958265 |
13 | 182a12b15 |
14 | c8b021ad |
15 | 7bcdaee2 |
hex | 4f57486d |
1331120237 has 2 divisors, whose sum is σ = 1331120238. Its totient is φ = 1331120236.
The previous prime is 1331120207. The next prime is 1331120243. The reversal of 1331120237 is 7320211331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 953944996 + 377175241 = 30886^2 + 19421^2 .
It is an emirp because it is prime and its reverse (7320211331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1331120237 - 26 = 1331120173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1331120207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665560118 + 665560119.
It is an arithmetic number, because the mean of its divisors is an integer number (665560119).
Almost surely, 21331120237 is an apocalyptic number.
It is an amenable number.
1331120237 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331120237 is an equidigital number, since it uses as much as digits as its factorization.
1331120237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 23.
The square root of 1331120237 is about 36484.5205121295. The cubic root of 1331120237 is about 1100.0331221431.
Adding to 1331120237 its reverse (7320211331), we get a palindrome (8651331568).
The spelling of 1331120237 in words is "one billion, three hundred thirty-one million, one hundred twenty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •