Base | Representation |
---|---|
bin | 111011111101110… |
… | …0011101000010101 |
3 | 12012020010022212111 |
4 | 1313323203220111 |
5 | 13110044214031 |
6 | 531354151021 |
7 | 100601402041 |
oct | 16773435025 |
9 | 5166108774 |
10 | 2012101141 |
11 | 942862406 |
12 | 481a22471 |
13 | 260b233bb |
14 | 151329021 |
15 | bb9a31b1 |
hex | 77ee3a15 |
2012101141 has 2 divisors, whose sum is σ = 2012101142. Its totient is φ = 2012101140.
The previous prime is 2012101109. The next prime is 2012101153. The reversal of 2012101141 is 1411012102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1766520900 + 245580241 = 42030^2 + 15671^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012101141 - 25 = 2012101109 is a prime.
It is a super-2 number, since 2×20121011412 = 8097102003227003762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2012101541) 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, 1006050570 + 1006050571.
It is an arithmetic number, because the mean of its divisors is an integer number (1006050571).
Almost surely, 22012101141 is an apocalyptic number.
It is an amenable number.
2012101141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012101141 is an equidigital number, since it uses as much as digits as its factorization.
2012101141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 2012101141 is about 44856.4503834175. The cubic root of 2012101141 is about 1262.4570224366.
Adding to 2012101141 its reverse (1411012102), we get a palindrome (3423113243).
The spelling of 2012101141 in words is "two billion, twelve million, one hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •