Base | Representation |
---|---|
bin | 1001111010011100… |
… | …0111101100111001 |
3 | 20212110020121121022 |
4 | 2132213013230321 |
5 | 20422212232124 |
6 | 1120015352225 |
7 | 122641411454 |
oct | 23647075471 |
9 | 6773217538 |
10 | 2661055289 |
11 | 1146107252 |
12 | 623222675 |
13 | 3353cc339 |
14 | 1b35b649b |
15 | 108940c5e |
hex | 9e9c7b39 |
2661055289 has 2 divisors, whose sum is σ = 2661055290. Its totient is φ = 2661055288.
The previous prime is 2661055261. The next prime is 2661055291. The reversal of 2661055289 is 9825501662.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1720590400 + 940464889 = 41480^2 + 30667^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2661055289 is a prime.
It is a super-2 number, since 2×26610552892 = 14162430502229747042, which contains 22 as substring.
Together with 2661055291, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2661055489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1330527644 + 1330527645.
It is an arithmetic number, because the mean of its divisors is an integer number (1330527645).
Almost surely, 22661055289 is an apocalyptic number.
It is an amenable number.
2661055289 is a deficient number, since it is larger than the sum of its proper divisors (1).
2661055289 is an equidigital number, since it uses as much as digits as its factorization.
2661055289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 44.
The square root of 2661055289 is about 51585.4174064725. The cubic root of 2661055289 is about 1385.7491876522.
The spelling of 2661055289 in words is "two billion, six hundred sixty-one million, fifty-five thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •