Base | Representation |
---|---|
bin | 10001110000011010010… |
… | …100001100001000111001 |
3 | 11022122120200112212202022 |
4 | 101300122110030020321 |
5 | 124442443311243111 |
6 | 2332320250244225 |
7 | 154104665446436 |
oct | 21603224141071 |
9 | 4278520485668 |
10 | 1220212212281 |
11 | 430541a8a367 |
12 | 17859a726675 |
13 | 8b0b0c3442a |
14 | 430b6a90b8d |
15 | 21b193c42db |
hex | 11c1a50c239 |
1220212212281 has 2 divisors, whose sum is σ = 1220212212282. Its totient is φ = 1220212212280.
The previous prime is 1220212212187. The next prime is 1220212212301. The reversal of 1220212212281 is 1822122120221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1220105813056 + 106399225 = 1104584^2 + 10315^2 .
It is a cyclic number.
It is not a de Polignac number, because 1220212212281 - 214 = 1220212195897 is a prime.
It is a super-3 number, since 3×12202122122813 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1220212212281.
It is not a weakly prime, because it can be changed into another prime (1220212212181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610106106140 + 610106106141.
It is an arithmetic number, because the mean of its divisors is an integer number (610106106141).
Almost surely, 21220212212281 is an apocalyptic number.
It is an amenable number.
1220212212281 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220212212281 is an equidigital number, since it uses as much as digits as its factorization.
1220212212281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1024, while the sum is 26.
The spelling of 1220212212281 in words is "one trillion, two hundred twenty billion, two hundred twelve million, two hundred twelve thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •