Base | Representation |
---|---|
bin | 111000100010111011… |
… | …1010110100000001001 |
3 | 102121102202021020101002 |
4 | 1301011313112200021 |
5 | 3442142343103111 |
6 | 131441300304345 |
7 | 11526115234055 |
oct | 1610567264011 |
9 | 377382236332 |
10 | 121431222281 |
11 | 47553839656 |
12 | 1b64b0a20b5 |
13 | b5b2878265 |
14 | 5c3d464c65 |
15 | 325a96663b |
hex | 1c45dd6809 |
121431222281 has 2 divisors, whose sum is σ = 121431222282. Its totient is φ = 121431222280.
The previous prime is 121431222247. The next prime is 121431222307. The reversal of 121431222281 is 182222134121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104270222281 + 17161000000 = 322909^2 + 131000^2 .
It is an emirp because it is prime and its reverse (182222134121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121431222281 - 210 = 121431221257 is a prime.
It is a super-2 number, since 2×1214312222812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (121431242281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60715611140 + 60715611141.
It is an arithmetic number, because the mean of its divisors is an integer number (60715611141).
Almost surely, 2121431222281 is an apocalyptic number.
It is an amenable number.
121431222281 is a deficient number, since it is larger than the sum of its proper divisors (1).
121431222281 is an equidigital number, since it uses as much as digits as its factorization.
121431222281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3072, while the sum is 29.
The spelling of 121431222281 in words is "one hundred twenty-one billion, four hundred thirty-one million, two hundred twenty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •