Base | Representation |
---|---|
bin | 1001101110101010… |
… | …1001111000000101 |
3 | 20202000021120100202 |
4 | 2123222221320011 |
5 | 20322040300203 |
6 | 1111052420245 |
7 | 121501442045 |
oct | 23352517005 |
9 | 6660246322 |
10 | 2611650053 |
11 | 1120232381 |
12 | 60a777685 |
13 | 3280c187c |
14 | 1aabd5725 |
15 | 104432388 |
hex | 9baa9e05 |
2611650053 has 2 divisors, whose sum is σ = 2611650054. Its totient is φ = 2611650052.
The previous prime is 2611650049. The next prime is 2611650061. The reversal of 2611650053 is 3500561162.
2611650053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2265950404 + 345699649 = 47602^2 + 18593^2 .
It is a cyclic number.
It is not a de Polignac number, because 2611650053 - 22 = 2611650049 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2611649998 and 2611650025.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2611653053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1305825026 + 1305825027.
It is an arithmetic number, because the mean of its divisors is an integer number (1305825027).
Almost surely, 22611650053 is an apocalyptic number.
It is an amenable number.
2611650053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2611650053 is an equidigital number, since it uses as much as digits as its factorization.
2611650053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5400, while the sum is 29.
The square root of 2611650053 is about 51104.3056209553. The cubic root of 2611650053 is about 1377.1196052418.
The spelling of 2611650053 in words is "two billion, six hundred eleven million, six hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •