Base | Representation |
---|---|
bin | 1101000000011100011011… |
… | …01111000110000001100001 |
3 | 10202021101012221111102211122 |
4 | 12200032031233012001201 |
5 | 12222111023140010321 |
6 | 140455500444422025 |
7 | 6011316141250655 |
oct | 640161557060141 |
9 | 122241187442748 |
10 | 28602565156961 |
11 | 91283094001a4 |
12 | 325b451247915 |
13 | 12c62970c8b43 |
14 | 70c52b712a65 |
15 | 349041e658ab |
hex | 1a038dbc6061 |
28602565156961 has 2 divisors, whose sum is σ = 28602565156962. Its totient is φ = 28602565156960.
The previous prime is 28602565156951. The next prime is 28602565156967. The reversal of 28602565156961 is 16965156520682.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27641106465361 + 961458691600 = 5257481^2 + 980540^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-28602565156961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 28602565156894 and 28602565156903.
It is not a weakly prime, because it can be changed into another prime (28602565156967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14301282578480 + 14301282578481.
It is an arithmetic number, because the mean of its divisors is an integer number (14301282578481).
Almost surely, 228602565156961 is an apocalyptic number.
It is an amenable number.
28602565156961 is a deficient number, since it is larger than the sum of its proper divisors (1).
28602565156961 is an equidigital number, since it uses as much as digits as its factorization.
28602565156961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656000, while the sum is 62.
The spelling of 28602565156961 in words is "twenty-eight trillion, six hundred two billion, five hundred sixty-five million, one hundred fifty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •