Base | Representation |
---|---|
bin | 1001111001001110… |
… | …0100011011001101 |
3 | 20212002121020010001 |
4 | 2132103210123031 |
5 | 20414404230221 |
6 | 1115313444301 |
7 | 122550014221 |
oct | 23623443315 |
9 | 6762536101 |
10 | 2655930061 |
11 | 1143226624 |
12 | 621570691 |
13 | 334326565 |
14 | 1b2a40781 |
15 | 10827c391 |
hex | 9e4e46cd |
2655930061 has 2 divisors, whose sum is σ = 2655930062. Its totient is φ = 2655930060.
The previous prime is 2655930059. The next prime is 2655930133. The reversal of 2655930061 is 1600395562.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1345055625 + 1310874436 = 36675^2 + 36206^2 .
It is a cyclic number.
It is not a de Polignac number, because 2655930061 - 21 = 2655930059 is a prime.
Together with 2655930059, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 2655930061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2655930001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1327965030 + 1327965031.
It is an arithmetic number, because the mean of its divisors is an integer number (1327965031).
Almost surely, 22655930061 is an apocalyptic number.
It is an amenable number.
2655930061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2655930061 is an equidigital number, since it uses as much as digits as its factorization.
2655930061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 37.
The square root of 2655930061 is about 51535.7163625383. The cubic root of 2655930061 is about 1384.8589587334.
The spelling of 2655930061 in words is "two billion, six hundred fifty-five million, nine hundred thirty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •