Base | Representation |
---|---|
bin | 111110001001010… |
… | …000111101000011 |
3 | 2200122212101110021 |
4 | 332021100331003 |
5 | 4113402204011 |
6 | 251242514311 |
7 | 34560043114 |
oct | 7611207503 |
9 | 2618771407 |
10 | 1042616131 |
11 | 495590a27 |
12 | 251205997 |
13 | 13800b72b |
14 | 9c68220b |
15 | 617ed471 |
hex | 3e250f43 |
1042616131 has 2 divisors, whose sum is σ = 1042616132. Its totient is φ = 1042616130.
The previous prime is 1042616129. The next prime is 1042616219. The reversal of 1042616131 is 1316162401.
1042616131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1042616131 - 21 = 1042616129 is a prime.
It is a super-2 number, since 2×10426161312 = 2174096793242818322, which contains 22 as substring.
Together with 1042616129, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1042616096 and 1042616105.
It is not a weakly prime, because it can be changed into another prime (1042616111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521308065 + 521308066.
It is an arithmetic number, because the mean of its divisors is an integer number (521308066).
Almost surely, 21042616131 is an apocalyptic number.
1042616131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042616131 is an equidigital number, since it uses as much as digits as its factorization.
1042616131 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 25.
The square root of 1042616131 is about 32289.5669063554. The cubic root of 1042616131 is about 1014.0082302058.
Adding to 1042616131 its reverse (1316162401), we get a palindrome (2358778532).
The spelling of 1042616131 in words is "one billion, forty-two million, six hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •