Base | Representation |
---|---|
bin | 1001110011011000… |
… | …0101110001101011 |
3 | 20210101111020200001 |
4 | 2130312011301223 |
5 | 20342121101011 |
6 | 1113040323431 |
7 | 122131513246 |
oct | 23466056153 |
9 | 6711436601 |
10 | 2631425131 |
11 | 1130409715 |
12 | 615313577 |
13 | 32c2267ba |
14 | 1ad6a225d |
15 | 10603b7c1 |
hex | 9cd85c6b |
2631425131 has 2 divisors, whose sum is σ = 2631425132. Its totient is φ = 2631425130.
The previous prime is 2631425129. The next prime is 2631425161. The reversal of 2631425131 is 1315241362.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2631425131 - 21 = 2631425129 is a prime.
It is a super-2 number, since 2×26314251312 = 13848796440116734322, which contains 22 as substring.
Together with 2631425129, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 2631425131.
It is not a weakly prime, because it can be changed into another prime (2631425161) 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, 1315712565 + 1315712566.
It is an arithmetic number, because the mean of its divisors is an integer number (1315712566).
Almost surely, 22631425131 is an apocalyptic number.
2631425131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2631425131 is an equidigital number, since it uses as much as digits as its factorization.
2631425131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4320, while the sum is 28.
The square root of 2631425131 is about 51297.4183658398. The cubic root of 2631425131 is about 1380.5866600039.
Adding to 2631425131 its reverse (1315241362), we get a palindrome (3946666493).
The spelling of 2631425131 in words is "two billion, six hundred thirty-one million, four hundred twenty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •