Base | Representation |
---|---|
bin | 110111010110001110101000… |
… | …101010111000011010100101 |
3 | 1011220212201211101120021112211 |
4 | 313112032220222320122211 |
5 | 223401143331414023323 |
6 | 2221413352322243421 |
7 | 102162344014031155 |
oct | 6726165052703245 |
9 | 1156781741507484 |
10 | 243420101314213 |
11 | 7061998127436a |
12 | 233745434b6571 |
13 | a5a9556383225 |
14 | 441784aad4765 |
15 | 1d21dae9c870d |
hex | dd63a8ab86a5 |
243420101314213 has 2 divisors, whose sum is σ = 243420101314214. Its totient is φ = 243420101314212.
The previous prime is 243420101314109. The next prime is 243420101314259. The reversal of 243420101314213 is 312413101024342.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 216502443416484 + 26917657897729 = 14714022^2 + 5188223^2 .
It is a cyclic number.
It is not a de Polignac number, because 243420101314213 - 213 = 243420101306021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (243420101314283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121710050657106 + 121710050657107.
It is an arithmetic number, because the mean of its divisors is an integer number (121710050657107).
Almost surely, 2243420101314213 is an apocalyptic number.
It is an amenable number.
243420101314213 is a deficient number, since it is larger than the sum of its proper divisors (1).
243420101314213 is an equidigital number, since it uses as much as digits as its factorization.
243420101314213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 243420101314213 its reverse (312413101024342), we get a palindrome (555833202338555).
The spelling of 243420101314213 in words is "two hundred forty-three trillion, four hundred twenty billion, one hundred one million, three hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •