Base | Representation |
---|---|
bin | 111011111110001… |
… | …1001010100011101 |
3 | 12012020112111112101 |
4 | 1313330121110131 |
5 | 13110123233203 |
6 | 531403005101 |
7 | 100603306141 |
oct | 16774312435 |
9 | 5166474471 |
10 | 2012321053 |
11 | 9429a2656 |
12 | 481b09791 |
13 | 260b9c522 |
14 | 151385221 |
15 | bb9e841d |
hex | 77f1951d |
2012321053 has 2 divisors, whose sum is σ = 2012321054. Its totient is φ = 2012321052.
The previous prime is 2012320997. The next prime is 2012321089. The reversal of 2012321053 is 3501232102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1326562084 + 685758969 = 36422^2 + 26187^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012321053 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2012321053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2012321653) 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, 1006160526 + 1006160527.
It is an arithmetic number, because the mean of its divisors is an integer number (1006160527).
Almost surely, 22012321053 is an apocalyptic number.
It is an amenable number.
2012321053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012321053 is an equidigital number, since it uses as much as digits as its factorization.
2012321053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 2012321053 is about 44858.9016026920. The cubic root of 2012321053 is about 1262.5030140502.
Adding to 2012321053 its reverse (3501232102), we get a palindrome (5513553155).
The spelling of 2012321053 in words is "two billion, twelve million, three hundred twenty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •