Base | Representation |
---|---|
bin | 111101101111010… |
… | …0100111001110001 |
3 | 12100101002211211221 |
4 | 1323132210321301 |
5 | 13220313104131 |
6 | 541321505041 |
7 | 102223264111 |
oct | 17336447161 |
9 | 5311084757 |
10 | 2071613041 |
11 | 97340a5a3 |
12 | 499942181 |
13 | 27025c144 |
14 | 1591bb041 |
15 | c1d0b411 |
hex | 7b7a4e71 |
2071613041 has 2 divisors, whose sum is σ = 2071613042. Its totient is φ = 2071613040.
The previous prime is 2071613023. The next prime is 2071613051. The reversal of 2071613041 is 1403161702.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1295712016 + 775901025 = 35996^2 + 27855^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2071613041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2071612997 and 2071613015.
It is not a weakly prime, because it can be changed into another prime (2071613051) 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, 1035806520 + 1035806521.
It is an arithmetic number, because the mean of its divisors is an integer number (1035806521).
Almost surely, 22071613041 is an apocalyptic number.
It is an amenable number.
2071613041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2071613041 is an equidigital number, since it uses as much as digits as its factorization.
2071613041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 25.
The square root of 2071613041 is about 45514.9760079032. The cubic root of 2071613041 is about 1274.7828498055.
Adding to 2071613041 its reverse (1403161702), we get a palindrome (3474774743).
The spelling of 2071613041 in words is "two billion, seventy-one million, six hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •