Base | Representation |
---|---|
bin | 110000000000110… |
… | …1100111101101101 |
3 | 11011021111021112211 |
4 | 1200001230331231 |
5 | 11244412342203 |
6 | 423510330421 |
7 | 54631530112 |
oct | 14001547555 |
9 | 4137437484 |
10 | 1611059053 |
11 | 75744556a |
12 | 38b659a11 |
13 | 1c8a086a6 |
14 | 113d72909 |
15 | 96685c6d |
hex | 6006cf6d |
1611059053 has 2 divisors, whose sum is σ = 1611059054. Its totient is φ = 1611059052.
The previous prime is 1611059033. The next prime is 1611059063. The reversal of 1611059053 is 3509501161.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1611059044 + 9 = 40138^2 + 3^2 .
It is a cyclic number.
It is not a de Polignac number, because 1611059053 - 221 = 1608961901 is a prime.
It is a super-2 number, since 2×16110590532 = 5191022544506513618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1611059003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 805529526 + 805529527.
It is an arithmetic number, because the mean of its divisors is an integer number (805529527).
Almost surely, 21611059053 is an apocalyptic number.
It is an amenable number.
1611059053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1611059053 is an equidigital number, since it uses as much as digits as its factorization.
1611059053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4050, while the sum is 31.
The square root of 1611059053 is about 40138.0001121132. Note that the first 3 decimals coincide. The cubic root of 1611059053 is about 1172.2956493489.
The spelling of 1611059053 in words is "one billion, six hundred eleven million, fifty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.213 sec. • engine limits •