Base | Representation |
---|---|
bin | 111011011110000110011001… |
… | …100101011000010110100001 |
3 | 1021022002020112020002201110002 |
4 | 323132012121211120112201 |
5 | 233240241423213401013 |
6 | 2324135514213145345 |
7 | 106043411060640005 |
oct | 7336063145302641 |
9 | 1238066466081402 |
10 | 261553200137633 |
11 | 763800a8888638 |
12 | 2540291962b255 |
13 | b2c348ccaca41 |
14 | 488335733a705 |
15 | 20388eb7aa358 |
hex | ede1999585a1 |
261553200137633 has 2 divisors, whose sum is σ = 261553200137634. Its totient is φ = 261553200137632.
The previous prime is 261553200137611. The next prime is 261553200137689. The reversal of 261553200137633 is 336731002355162.
261553200137633 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 255364011492769 + 6189188644864 = 15980113^2 + 2487808^2 .
It is a cyclic number.
It is not a de Polignac number, because 261553200137633 - 220 = 261553199089057 is a prime.
It is not a weakly prime, because it can be changed into another prime (261553200131633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130776600068816 + 130776600068817.
It is an arithmetic number, because the mean of its divisors is an integer number (130776600068817).
Almost surely, 2261553200137633 is an apocalyptic number.
It is an amenable number.
261553200137633 is a deficient number, since it is larger than the sum of its proper divisors (1).
261553200137633 is an equidigital number, since it uses as much as digits as its factorization.
261553200137633 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2041200, while the sum is 47.
The spelling of 261553200137633 in words is "two hundred sixty-one trillion, five hundred fifty-three billion, two hundred million, one hundred thirty-seven thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •