Base | Representation |
---|---|
bin | 1001101101001001… |
… | …0010100100010001 |
3 | 20201120021002010201 |
4 | 2123102102210101 |
5 | 20313421404441 |
6 | 1110303455201 |
7 | 121363241206 |
oct | 23322224421 |
9 | 6646232121 |
10 | 2605263121 |
11 | 111766a81a |
12 | 6085b7501 |
13 | 326996716 |
14 | 1aa011cad |
15 | 103abec31 |
hex | 9b492911 |
2605263121 has 2 divisors, whose sum is σ = 2605263122. Its totient is φ = 2605263120.
The previous prime is 2605263083. The next prime is 2605263131. The reversal of 2605263121 is 1213625062.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2151104400 + 454158721 = 46380^2 + 21311^2 .
It is a cyclic number.
It is not a de Polignac number, because 2605263121 - 27 = 2605262993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2605263121.
It is not a weakly prime, because it can be changed into another prime (2605263131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1302631560 + 1302631561.
It is an arithmetic number, because the mean of its divisors is an integer number (1302631561).
Almost surely, 22605263121 is an apocalyptic number.
It is an amenable number.
2605263121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2605263121 is an equidigital number, since it uses as much as digits as its factorization.
2605263121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 2605263121 is about 51041.7781919870. The cubic root of 2605263121 is about 1375.9960819433.
Adding to 2605263121 its reverse (1213625062), we get a palindrome (3818888183).
The spelling of 2605263121 in words is "two billion, six hundred five million, two hundred sixty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •