Base | Representation |
---|---|
bin | 1001110011011001… |
… | …0100111010100101 |
3 | 20210101121101201201 |
4 | 2130312110322211 |
5 | 20342130042031 |
6 | 1113041522501 |
7 | 122132162113 |
oct | 23466247245 |
9 | 6711541651 |
10 | 2631487141 |
11 | 1130451268 |
12 | 615343431 |
13 | 32c248aaa |
14 | 1ad6baab3 |
15 | 10604ed61 |
hex | 9cd94ea5 |
2631487141 has 2 divisors, whose sum is σ = 2631487142. Its totient is φ = 2631487140.
The previous prime is 2631487139. The next prime is 2631487147. The reversal of 2631487141 is 1417841362.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1791067041 + 840420100 = 42321^2 + 28990^2 .
It is a cyclic number.
It is not a de Polignac number, because 2631487141 - 21 = 2631487139 is a prime.
Together with 2631487139, 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 2631487141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2631487147) 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, 1315743570 + 1315743571.
It is an arithmetic number, because the mean of its divisors is an integer number (1315743571).
Almost surely, 22631487141 is an apocalyptic number.
It is an amenable number.
2631487141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2631487141 is an equidigital number, since it uses as much as digits as its factorization.
2631487141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32256, while the sum is 37.
The square root of 2631487141 is about 51298.0227786608. The cubic root of 2631487141 is about 1380.5975045086.
The spelling of 2631487141 in words is "two billion, six hundred thirty-one million, four hundred eighty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •