Base | Representation |
---|---|
bin | 1011011100010010100100… |
… | …10110011101111110101001 |
3 | 10022002101201021001201221021 |
4 | 11232021102112131332221 |
5 | 11244220320302313031 |
6 | 125302535222212441 |
7 | 5204562320353111 |
oct | 556112226357651 |
9 | 108071637051837 |
10 | 25161300041641 |
11 | 8020935a13235 |
12 | 29a4518584121 |
13 | 1106914a6580a |
14 | 62db5604a041 |
15 | 2d9783242511 |
hex | 16e25259dfa9 |
25161300041641 has 2 divisors, whose sum is σ = 25161300041642. Its totient is φ = 25161300041640.
The previous prime is 25161300041609. The next prime is 25161300041687. The reversal of 25161300041641 is 14614000316152.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19127502250000 + 6033797791641 = 4373500^2 + 2456379^2 .
It is a cyclic number.
It is not a de Polignac number, because 25161300041641 - 25 = 25161300041609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 25161300041597 and 25161300041606.
It is not a weakly prime, because it can be changed into another prime (25161300047641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12580650020820 + 12580650020821.
It is an arithmetic number, because the mean of its divisors is an integer number (12580650020821).
Almost surely, 225161300041641 is an apocalyptic number.
It is an amenable number.
25161300041641 is a deficient number, since it is larger than the sum of its proper divisors (1).
25161300041641 is an equidigital number, since it uses as much as digits as its factorization.
25161300041641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 34.
Adding to 25161300041641 its reverse (14614000316152), we get a palindrome (39775300357793).
The spelling of 25161300041641 in words is "twenty-five trillion, one hundred sixty-one billion, three hundred million, forty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •