Base | Representation |
---|---|
bin | 1110001001010000000… |
… | …0110100101001111101 |
3 | 212020020012000202112111 |
4 | 3202110000310221331 |
5 | 12440131330142341 |
6 | 303344443334021 |
7 | 23361541631521 |
oct | 3422400645175 |
9 | 766205022474 |
10 | 243001412221 |
11 | 94068a64707 |
12 | 3b118821311 |
13 | 19bb815b9a9 |
14 | ba93141d81 |
15 | 64c36cd681 |
hex | 3894034a7d |
243001412221 has 2 divisors, whose sum is σ = 243001412222. Its totient is φ = 243001412220.
The previous prime is 243001412207. The next prime is 243001412287. The reversal of 243001412221 is 122214100342.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198903512196 + 44097900025 = 445986^2 + 209995^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-243001412221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 243001412192 and 243001412201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (243001412201) 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, 121500706110 + 121500706111.
It is an arithmetic number, because the mean of its divisors is an integer number (121500706111).
Almost surely, 2243001412221 is an apocalyptic number.
It is an amenable number.
243001412221 is a deficient number, since it is larger than the sum of its proper divisors (1).
243001412221 is an equidigital number, since it uses as much as digits as its factorization.
243001412221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 243001412221 its reverse (122214100342), we get a palindrome (365215512563).
The spelling of 243001412221 in words is "two hundred forty-three billion, one million, four hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •