Base | Representation |
---|---|
bin | 11101010010000111110… |
… | …000000101100010011001 |
3 | 21010101011012021200221011 |
4 | 131102013300011202121 |
5 | 230432213442134111 |
6 | 4140240441013521 |
7 | 265246135453135 |
oct | 35220760054231 |
9 | 7111135250834 |
10 | 2012322224281 |
11 | 70646a486316 |
12 | 2860027842a1 |
13 | 1179b83a8645 |
14 | 6d57b1c83c5 |
15 | 37529b9c021 |
hex | 1d487c05899 |
2012322224281 has 2 divisors, whose sum is σ = 2012322224282. Its totient is φ = 2012322224280.
The previous prime is 2012322224257. The next prime is 2012322224327. The reversal of 2012322224281 is 1824222232102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1393677052681 + 618645171600 = 1180541^2 + 786540^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012322224281 - 223 = 2012313835673 is a prime.
It is a super-3 number, since 3×20123222242813 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (2012322224251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006161112140 + 1006161112141.
It is an arithmetic number, because the mean of its divisors is an integer number (1006161112141).
Almost surely, 22012322224281 is an apocalyptic number.
It is an amenable number.
2012322224281 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012322224281 is an equidigital number, since it uses as much as digits as its factorization.
2012322224281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12288, while the sum is 31.
Adding to 2012322224281 its reverse (1824222232102), we get a palindrome (3836544456383).
The spelling of 2012322224281 in words is "two trillion, twelve billion, three hundred twenty-two million, two hundred twenty-four thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •