Base | Representation |
---|---|
bin | 100110101010000110110… |
… | …110001001100001100001 |
3 | 100101222000200111210121222 |
4 | 212222012312021201201 |
5 | 322011104321140112 |
6 | 5352223031424425 |
7 | 362633560351415 |
oct | 46520666114141 |
9 | 10358020453558 |
10 | 2656552130657 |
11 | 934701470147 |
12 | 36aa35b25115 |
13 | 163686535589 |
14 | 92813718d45 |
15 | 49182a3c372 |
hex | 26a86d89861 |
2656552130657 has 2 divisors, whose sum is σ = 2656552130658. Its totient is φ = 2656552130656.
The previous prime is 2656552130569. The next prime is 2656552130707. The reversal of 2656552130657 is 7560312556562.
2656552130657 is digitally balanced in base 3, 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., 2654279606416 + 2272524241 = 1629196^2 + 47671^2 .
It is a cyclic number.
It is not a de Polignac number, because 2656552130657 - 212 = 2656552126561 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2656552130599 and 2656552130608.
It is not a weakly prime, because it can be changed into another prime (2656552130357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1328276065328 + 1328276065329.
It is an arithmetic number, because the mean of its divisors is an integer number (1328276065329).
Almost surely, 22656552130657 is an apocalyptic number.
It is an amenable number.
2656552130657 is a deficient number, since it is larger than the sum of its proper divisors (1).
2656552130657 is an equidigital number, since it uses as much as digits as its factorization.
2656552130657 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11340000, while the sum is 53.
The spelling of 2656552130657 in words is "two trillion, six hundred fifty-six billion, five hundred fifty-two million, one hundred thirty thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •