Base | Representation |
---|---|
bin | 11101010010001000011… |
… | …010010110000100101101 |
3 | 21010101011222010111210022 |
4 | 131102020122112010231 |
5 | 230432224311131221 |
6 | 4140241514251525 |
7 | 265246331561645 |
oct | 35221032260455 |
9 | 7111158114708 |
10 | 2012333302061 |
11 | 706475762205 |
12 | 286006426ba5 |
13 | 1179ba786944 |
14 | 6d57c86d525 |
15 | 3752ab394ab |
hex | 1d48869612d |
2012333302061 has 2 divisors, whose sum is σ = 2012333302062. Its totient is φ = 2012333302060.
The previous prime is 2012333302013. The next prime is 2012333302129. The reversal of 2012333302061 is 1602033332102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1377116332036 + 635216970025 = 1173506^2 + 797005^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012333302061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2012333302061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2012333301061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006166651030 + 1006166651031.
It is an arithmetic number, because the mean of its divisors is an integer number (1006166651031).
Almost surely, 22012333302061 is an apocalyptic number.
It is an amenable number.
2012333302061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012333302061 is an equidigital number, since it uses as much as digits as its factorization.
2012333302061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 2012333302061 its reverse (1602033332102), we get a palindrome (3614366634163).
The spelling of 2012333302061 in words is "two trillion, twelve billion, three hundred thirty-three million, three hundred two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •