Base | Representation |
---|---|
bin | 111100011001100101000001… |
… | …100001010010100001011001 |
3 | 1021211112222122101020010012121 |
4 | 330121211001201102201121 |
5 | 234304223302033122321 |
6 | 2340545324150141241 |
7 | 106644616002404641 |
oct | 7431450141224131 |
9 | 1254488571203177 |
10 | 265640531535961 |
11 | 777065758aa36a |
12 | 25962ab8651821 |
13 | b52ba43a885aa |
14 | 49850dad99521 |
15 | 20a9dbe6b0441 |
hex | f19941852859 |
265640531535961 has 2 divisors, whose sum is σ = 265640531535962. Its totient is φ = 265640531535960.
The previous prime is 265640531535949. The next prime is 265640531536067. The reversal of 265640531535961 is 169535135046562.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 216972900000000 + 48667631535961 = 14730000^2 + 6976219^2 .
It is a cyclic number.
It is not a de Polignac number, because 265640531535961 - 229 = 265639994665049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 265640531535961.
It is not a weakly prime, because it can be changed into another prime (265640531535761) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 132820265767980 + 132820265767981.
It is an arithmetic number, because the mean of its divisors is an integer number (132820265767981).
Almost surely, 2265640531535961 is an apocalyptic number.
It is an amenable number.
265640531535961 is a deficient number, since it is larger than the sum of its proper divisors (1).
265640531535961 is an equidigital number, since it uses as much as digits as its factorization.
265640531535961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 87480000, while the sum is 61.
The spelling of 265640531535961 in words is "two hundred sixty-five trillion, six hundred forty billion, five hundred thirty-one million, five hundred thirty-five thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •