Base | Representation |
---|---|
bin | 111011011110001111001101… |
… | …101000101110111000001001 |
3 | 1021022010010221201211112112021 |
4 | 323132033031220232320021 |
5 | 233240420313310204103 |
6 | 2324144121223044441 |
7 | 106044164430024352 |
oct | 7336171550567011 |
9 | 1238103851745467 |
10 | 261562663366153 |
11 | 76384114600256 |
12 | 2540471a8a0721 |
13 | b2c433a70bc46 |
14 | 48839b4094d29 |
15 | 2038ca2489bbd |
hex | ede3cda2ee09 |
261562663366153 has 2 divisors, whose sum is σ = 261562663366154. Its totient is φ = 261562663366152.
The previous prime is 261562663366051. The next prime is 261562663366201. The reversal of 261562663366153 is 351663366265162.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 146384542706704 + 115178120659449 = 12098948^2 + 10732107^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-261562663366153 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 261562663366091 and 261562663366100.
It is not a weakly prime, because it can be changed into another prime (261562663336153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130781331683076 + 130781331683077.
It is an arithmetic number, because the mean of its divisors is an integer number (130781331683077).
Almost surely, 2261562663366153 is an apocalyptic number.
It is an amenable number.
261562663366153 is a deficient number, since it is larger than the sum of its proper divisors (1).
261562663366153 is an equidigital number, since it uses as much as digits as its factorization.
261562663366153 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 125971200, while the sum is 61.
The spelling of 261562663366153 in words is "two hundred sixty-one trillion, five hundred sixty-two billion, six hundred sixty-three million, three hundred sixty-six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •