Base | Representation |
---|---|
bin | 11111000000000000100… |
… | …000100000011010000001 |
3 | 21112122201010102120212112 |
4 | 133000000200200122001 |
5 | 234400334422101121 |
6 | 4310352453505105 |
7 | 306624060531353 |
oct | 37000040403201 |
9 | 7478633376775 |
10 | 2130312300161 |
11 | 751507835721 |
12 | 2a4a51342195 |
13 | 125b700524a6 |
14 | 751716110d3 |
15 | 3a63347e75b |
hex | 1f000820681 |
2130312300161 has 2 divisors, whose sum is σ = 2130312300162. Its totient is φ = 2130312300160.
The previous prime is 2130312300113. The next prime is 2130312300163. The reversal of 2130312300161 is 1610032130312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2120795127025 + 9517173136 = 1456295^2 + 97556^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2130312300161 is a prime.
Together with 2130312300163, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2130312300163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1065156150080 + 1065156150081.
It is an arithmetic number, because the mean of its divisors is an integer number (1065156150081).
Almost surely, 22130312300161 is an apocalyptic number.
It is an amenable number.
2130312300161 is a deficient number, since it is larger than the sum of its proper divisors (1).
2130312300161 is an equidigital number, since it uses as much as digits as its factorization.
2130312300161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 2130312300161 its reverse (1610032130312), we get a palindrome (3740344430473).
The spelling of 2130312300161 in words is "two trillion, one hundred thirty billion, three hundred twelve million, three hundred thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •