Base | Representation |
---|---|
bin | 111101011001110… |
… | …0101011011011001 |
3 | 12022120220021021001 |
4 | 1322303211123121 |
5 | 13204421434001 |
6 | 540240145001 |
7 | 102025424623 |
oct | 17263453331 |
9 | 5276807231 |
10 | 2060343001 |
11 | 968012212 |
12 | 496008161 |
13 | 26ab14492 |
14 | 1578c5c13 |
15 | c0d32001 |
hex | 7ace56d9 |
2060343001 has 2 divisors, whose sum is σ = 2060343002. Its totient is φ = 2060343000.
The previous prime is 2060342993. The next prime is 2060343007. The reversal of 2060343001 is 1003430602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1760222025 + 300120976 = 41955^2 + 17324^2 .
It is a cyclic number.
It is not a de Polignac number, because 2060343001 - 23 = 2060342993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2060343001.
It is not a weakly prime, because it can be changed into another prime (2060343007) 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, 1030171500 + 1030171501.
It is an arithmetic number, because the mean of its divisors is an integer number (1030171501).
Almost surely, 22060343001 is an apocalyptic number.
It is an amenable number.
2060343001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2060343001 is an equidigital number, since it uses as much as digits as its factorization.
2060343001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 2060343001 is about 45391.0013218479. The cubic root of 2060343001 is about 1272.4669434045.
Adding to 2060343001 its reverse (1003430602), we get a palindrome (3063773603).
The spelling of 2060343001 in words is "two billion, sixty million, three hundred forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •