Base | Representation |
---|---|
bin | 111011001000010000101011… |
… | …001000101111101001110101 |
3 | 1021002202202201010112210001212 |
4 | 323020100223020233221311 |
5 | 233041144310302111322 |
6 | 2321030231441531205 |
7 | 105530110662301652 |
oct | 7310205310575165 |
9 | 1232682633483055 |
10 | 260052403550837 |
11 | 75951672285857 |
12 | 251bba93943b05 |
13 | b214ab483a001 |
14 | 4830863d92c29 |
15 | 200e85e5100e2 |
hex | ec842b22fa75 |
260052403550837 has 2 divisors, whose sum is σ = 260052403550838. Its totient is φ = 260052403550836.
The previous prime is 260052403550629. The next prime is 260052403550911. The reversal of 260052403550837 is 738055304250062.
260052403550837 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 256794663734596 + 3257739816241 = 16024814^2 + 1804921^2 .
It is a cyclic number.
It is not a de Polignac number, because 260052403550837 - 220 = 260052402502261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (260052403553837) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130026201775418 + 130026201775419.
It is an arithmetic number, because the mean of its divisors is an integer number (130026201775419).
Almost surely, 2260052403550837 is an apocalyptic number.
It is an amenable number.
260052403550837 is a deficient number, since it is larger than the sum of its proper divisors (1).
260052403550837 is an equidigital number, since it uses as much as digits as its factorization.
260052403550837 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6048000, while the sum is 50.
The spelling of 260052403550837 in words is "two hundred sixty trillion, fifty-two billion, four hundred three million, five hundred fifty thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •