Base | Representation |
---|---|
bin | 111101011011001… |
… | …0011110000100101 |
3 | 12022122020112202201 |
4 | 1322312103300211 |
5 | 13210112311221 |
6 | 540303334501 |
7 | 102034460500 |
oct | 17266236045 |
9 | 5278215681 |
10 | 2061057061 |
11 | 96845a748 |
12 | 4962b1431 |
13 | 26b0044bb |
14 | 157a30137 |
15 | c0e23891 |
hex | 7ad93c25 |
2061057061 has 6 divisors (see below), whose sum is σ = 2397556230. Its totient is φ = 1766620296.
The previous prime is 2061057049. The next prime is 2061057077. The reversal of 2061057061 is 1607501602.
It can be written as a sum of positive squares in only one way, i.e., 1233344161 + 827712900 = 35119^2 + 28770^2 .
It is a de Polignac number, because none of the positive numbers 2k-2061057061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2061051061) 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 in 5 ways as a sum of consecutive naturals, for example, 21031146 + ... + 21031243.
It is an arithmetic number, because the mean of its divisors is an integer number (399592705).
Almost surely, 22061057061 is an apocalyptic number.
It is an amenable number.
2061057061 is a deficient number, since it is larger than the sum of its proper divisors (336499169).
2061057061 is an equidigital number, since it uses as much as digits as its factorization.
2061057061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42062403 (or 42062396 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 2061057061 is about 45398.8662964176. The cubic root of 2061057061 is about 1272.6139274743.
Adding to 2061057061 its reverse (1607501602), we get a palindrome (3668558663).
The spelling of 2061057061 in words is "two billion, sixty-one million, fifty-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •