Base | Representation |
---|---|
bin | 110000010011011101000101… |
… | …010100000010001111001101 |
3 | 1000212012100212000102211121221 |
4 | 300103131011110002033031 |
5 | 210321132012320220442 |
6 | 2031455005434323341 |
7 | 62514336545254024 |
oct | 6023350524021715 |
9 | 1025170760384557 |
10 | 212443130241997 |
11 | 61766697705746 |
12 | 1b9b0a9a589551 |
13 | 91703bba25545 |
14 | 3a6643399d8bb |
15 | 19862000ae467 |
hex | c137455023cd |
212443130241997 has 2 divisors, whose sum is σ = 212443130241998. Its totient is φ = 212443130241996.
The previous prime is 212443130241973. The next prime is 212443130242019. The reversal of 212443130241997 is 799142031344212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129627651951396 + 82815478290601 = 11385414^2 + 9100301^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212443130241997 is a prime.
It is a super-3 number, since 3×2124431302419973 (a number of 44 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212443136241997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106221565120998 + 106221565120999.
It is an arithmetic number, because the mean of its divisors is an integer number (106221565120999).
Almost surely, 2212443130241997 is an apocalyptic number.
It is an amenable number.
212443130241997 is a deficient number, since it is larger than the sum of its proper divisors (1).
212443130241997 is an equidigital number, since it uses as much as digits as its factorization.
212443130241997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2612736, while the sum is 52.
The spelling of 212443130241997 in words is "two hundred twelve trillion, four hundred forty-three billion, one hundred thirty million, two hundred forty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •