Base | Representation |
---|---|
bin | 111101011100001… |
… | …1100010010101101 |
3 | 12022200021221220022 |
4 | 1322320130102231 |
5 | 13210233210201 |
6 | 540323331525 |
7 | 102042310103 |
oct | 17270342255 |
9 | 5280257808 |
10 | 2061616301 |
11 | 968801928 |
12 | 496520ba5 |
13 | 26b16bc04 |
14 | 157b37c73 |
15 | c0ed441b |
hex | 7ae1c4ad |
2061616301 has 2 divisors, whose sum is σ = 2061616302. Its totient is φ = 2061616300.
The previous prime is 2061616289. The next prime is 2061616303. The reversal of 2061616301 is 1036161602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1052029225 + 1009587076 = 32435^2 + 31774^2 .
It is a cyclic number.
It is not a de Polignac number, because 2061616301 - 210 = 2061615277 is a prime.
Together with 2061616303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2061616303) 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, 1030808150 + 1030808151.
It is an arithmetic number, because the mean of its divisors is an integer number (1030808151).
Almost surely, 22061616301 is an apocalyptic number.
It is an amenable number.
2061616301 is a deficient number, since it is larger than the sum of its proper divisors (1).
2061616301 is an equidigital number, since it uses as much as digits as its factorization.
2061616301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 2061616301 is about 45405.0250633121. The cubic root of 2061616301 is about 1272.7290192665.
Adding to 2061616301 its reverse (1036161602), we get a palindrome (3097777903).
The spelling of 2061616301 in words is "two billion, sixty-one million, six hundred sixteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •