Base | Representation |
---|---|
bin | 111101011011010… |
… | …0101100110001001 |
3 | 12022122101020222122 |
4 | 1322312211212021 |
5 | 13210122130441 |
6 | 540305101025 |
7 | 102035213501 |
oct | 17266454611 |
9 | 5278336878 |
10 | 2061130121 |
11 | 9684aa626 |
12 | 496327775 |
13 | 26b02b82b |
14 | 157a4ca01 |
15 | c0e3a34b |
hex | 7ada5989 |
2061130121 has 2 divisors, whose sum is σ = 2061130122. Its totient is φ = 2061130120.
The previous prime is 2061130067. The next prime is 2061130163. The reversal of 2061130121 is 1210311602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2032657225 + 28472896 = 45085^2 + 5336^2 .
It is a cyclic number.
It is not a de Polignac number, because 2061130121 - 210 = 2061129097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2061130121.
It is not a weakly prime, because it can be changed into another prime (2061130171) 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, 1030565060 + 1030565061.
It is an arithmetic number, because the mean of its divisors is an integer number (1030565061).
Almost surely, 22061130121 is an apocalyptic number.
It is an amenable number.
2061130121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2061130121 is an equidigital number, since it uses as much as digits as its factorization.
2061130121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 2061130121 is about 45399.6709349308. The cubic root of 2061130121 is about 1272.6289644306.
Adding to 2061130121 its reverse (1210311602), we get a palindrome (3271441723).
The spelling of 2061130121 in words is "two billion, sixty-one million, one hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •