Base | Representation |
---|---|
bin | 111101011001101… |
… | …1011011011000101 |
3 | 12022120211012001021 |
4 | 1322303123123011 |
5 | 13204414131041 |
6 | 540235231141 |
7 | 102025164301 |
oct | 17263333305 |
9 | 5276735037 |
10 | 2060302021 |
11 | 967a94448 |
12 | 495ba84b1 |
13 | 26aacb92b |
14 | 1578b4d01 |
15 | c0d24cd1 |
hex | 7acdb6c5 |
2060302021 has 2 divisors, whose sum is σ = 2060302022. Its totient is φ = 2060302020.
The previous prime is 2060301989. The next prime is 2060302039. The reversal of 2060302021 is 1202030602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1292402500 + 767899521 = 35950^2 + 27711^2 .
It is a cyclic number.
It is not a de Polignac number, because 2060302021 - 25 = 2060301989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2060301986 and 2060302004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2060302081) 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, 1030151010 + 1030151011.
It is an arithmetic number, because the mean of its divisors is an integer number (1030151011).
Almost surely, 22060302021 is an apocalyptic number.
It is an amenable number.
2060302021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2060302021 is an equidigital number, since it uses as much as digits as its factorization.
2060302021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2060302021 is about 45390.5499085437. The cubic root of 2060302021 is about 1272.4585069385.
Adding to 2060302021 its reverse (1202030602), we get a palindrome (3262332623).
The spelling of 2060302021 in words is "two billion, sixty million, three hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •