Base | Representation |
---|---|
bin | 1100101111101101011001… |
… | …10101011111111010101001 |
3 | 10200020102000221022121202011 |
4 | 12113312230311133322221 |
5 | 12133200421143440123 |
6 | 135335403420435521 |
7 | 5621632045231162 |
oct | 627665465377251 |
9 | 120212027277664 |
10 | 28027561311913 |
11 | 8a264707578a9 |
12 | 3187b196a8ba1 |
13 | 1283cabc59987 |
14 | 6cc7810d4769 |
15 | 3390db7aae0d |
hex | 197dacd5fea9 |
28027561311913 has 2 divisors, whose sum is σ = 28027561311914. Its totient is φ = 28027561311912.
The previous prime is 28027561311881. The next prime is 28027561311979. The reversal of 28027561311913 is 31911316572082.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21664211997289 + 6363349314624 = 4654483^2 + 2522568^2 .
It is a cyclic number.
It is not a de Polignac number, because 28027561311913 - 25 = 28027561311881 is a prime.
It is not a weakly prime, because it can be changed into another prime (28027561311613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14013780655956 + 14013780655957.
It is an arithmetic number, because the mean of its divisors is an integer number (14013780655957).
Almost surely, 228027561311913 is an apocalyptic number.
It is an amenable number.
28027561311913 is a deficient number, since it is larger than the sum of its proper divisors (1).
28027561311913 is an equidigital number, since it uses as much as digits as its factorization.
28027561311913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 544320, while the sum is 49.
Adding to 28027561311913 its reverse (31911316572082), we get a palindrome (59938877883995).
The spelling of 28027561311913 in words is "twenty-eight trillion, twenty-seven billion, five hundred sixty-one million, three hundred eleven thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.194 sec. • engine limits •