Base | Representation |
---|---|
bin | 100110101110100011010… |
… | …110110011101111100001 |
3 | 100102102100100022002202002 |
4 | 212232203112303233201 |
5 | 322100343301442122 |
6 | 5354332423533345 |
7 | 363163060560356 |
oct | 46564326635741 |
9 | 10372310262662 |
10 | 2661325421537 |
11 | 936730902242 |
12 | 36b9485ba255 |
13 | 163c67417a53 |
14 | 92b4764462d |
15 | 49361b10992 |
hex | 26ba35b3be1 |
2661325421537 has 2 divisors, whose sum is σ = 2661325421538. Its totient is φ = 2661325421536.
The previous prime is 2661325421483. The next prime is 2661325421591. The reversal of 2661325421537 is 7351245231662.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (2661325421483) and next prime (2661325421591).
It can be written as a sum of positive squares in only one way, i.e., 1946022210001 + 715303211536 = 1394999^2 + 845756^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2661325421537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2661325421491 and 2661325421500.
It is not a weakly prime, because it can be changed into another prime (2661325471537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1330662710768 + 1330662710769.
It is an arithmetic number, because the mean of its divisors is an integer number (1330662710769).
Almost surely, 22661325421537 is an apocalyptic number.
It is an amenable number.
2661325421537 is a deficient number, since it is larger than the sum of its proper divisors (1).
2661325421537 is an equidigital number, since it uses as much as digits as its factorization.
2661325421537 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1814400, while the sum is 47.
The spelling of 2661325421537 in words is "two trillion, six hundred sixty-one billion, three hundred twenty-five million, four hundred twenty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •