Base | Representation |
---|---|
bin | 111101000011100111010010… |
… | …110010011110111101000001 |
3 | 1022012210010202201122211222102 |
4 | 331003213102302132331001 |
5 | 240144040233302400221 |
6 | 2351040334432520145 |
7 | 110363410401612314 |
oct | 7503472262367501 |
9 | 1265703681584872 |
10 | 268529186762561 |
11 | 7861a65242785a |
12 | 2614a9093b0055 |
13 | b6ab26960819a |
14 | 4a44c4c25497b |
15 | 210a0d8c2530b |
hex | f439d2c9ef41 |
268529186762561 has 2 divisors, whose sum is σ = 268529186762562. Its totient is φ = 268529186762560.
The previous prime is 268529186762467. The next prime is 268529186762651. The reversal of 268529186762561 is 165267681925862.
Together with next prime (268529186762651) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 172597348292161 + 95931838470400 = 13137631^2 + 9794480^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-268529186762561 is a prime.
It is not a weakly prime, because it can be changed into another prime (268529186762461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 134264593381280 + 134264593381281.
It is an arithmetic number, because the mean of its divisors is an integer number (134264593381281).
Almost surely, 2268529186762561 is an apocalyptic number.
It is an amenable number.
268529186762561 is a deficient number, since it is larger than the sum of its proper divisors (1).
268529186762561 is an equidigital number, since it uses as much as digits as its factorization.
268529186762561 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1045094400, while the sum is 74.
The spelling of 268529186762561 in words is "two hundred sixty-eight trillion, five hundred twenty-nine billion, one hundred eighty-six million, seven hundred sixty-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •