Base | Representation |
---|---|
bin | 1110001010110010010… |
… | …0001011010101001111 |
3 | 212021021220010112001202 |
4 | 3202230210023111033 |
5 | 12442002303131302 |
6 | 303453400300115 |
7 | 23405003123633 |
oct | 3425444132517 |
9 | 767256115052 |
10 | 243413333327 |
11 | 9425a53207a |
12 | 3b21277163b |
13 | 19c525b53a8 |
14 | bad1b2adc3 |
15 | 64e9949202 |
hex | 38ac90b54f |
243413333327 has 2 divisors, whose sum is σ = 243413333328. Its totient is φ = 243413333326.
The previous prime is 243413333287. The next prime is 243413333353. The reversal of 243413333327 is 723333314342.
243413333327 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 243413333327 - 212 = 243413329231 is a prime.
It is a super-2 number, since 2×2434133333272 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (243413333027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121706666663 + 121706666664.
It is an arithmetic number, because the mean of its divisors is an integer number (121706666664).
Almost surely, 2243413333327 is an apocalyptic number.
243413333327 is a deficient number, since it is larger than the sum of its proper divisors (1).
243413333327 is an equidigital number, since it uses as much as digits as its factorization.
243413333327 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 326592, while the sum is 38.
Adding to 243413333327 its reverse (723333314342), we get a palindrome (966746647669).
The spelling of 243413333327 in words is "two hundred forty-three billion, four hundred thirteen million, three hundred thirty-three thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •