Base | Representation |
---|---|
bin | 111110000111100… |
… | …001101001101101 |
3 | 2200122000020002022 |
4 | 332013201221231 |
5 | 4113243111422 |
6 | 251225035525 |
7 | 34553134016 |
oct | 7607415155 |
9 | 2618006068 |
10 | 1042160237 |
11 | 4952aa458 |
12 | 251025ba5 |
13 | 137bac081 |
14 | 9c5a400d |
15 | 6175d342 |
hex | 3e1e1a6d |
1042160237 has 2 divisors, whose sum is σ = 1042160238. Its totient is φ = 1042160236.
The previous prime is 1042160183. The next prime is 1042160239. The reversal of 1042160237 is 7320612401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 970571716 + 71588521 = 31154^2 + 8461^2 .
It is a cyclic number.
It is not a de Polignac number, because 1042160237 - 218 = 1041898093 is a prime.
Together with 1042160239, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1042160239) 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, 521080118 + 521080119.
It is an arithmetic number, because the mean of its divisors is an integer number (521080119).
Almost surely, 21042160237 is an apocalyptic number.
It is an amenable number.
1042160237 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042160237 is an equidigital number, since it uses as much as digits as its factorization.
1042160237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 1042160237 is about 32282.5066715706. The cubic root of 1042160237 is about 1013.8604136862.
Adding to 1042160237 its reverse (7320612401), we get a palindrome (8362772638).
The spelling of 1042160237 in words is "one billion, forty-two million, one hundred sixty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •