Base | Representation |
---|---|
bin | 1110001001101100101… |
… | …0100101110010111111 |
3 | 212020112112211110002022 |
4 | 3202123022211302333 |
5 | 12440403040211221 |
6 | 303404411350355 |
7 | 23364526626110 |
oct | 3423312456277 |
9 | 766475743068 |
10 | 243121413311 |
11 | 9411a777267 |
12 | 3b150a523bb |
13 | 19c06c8625a |
14 | baa505c207 |
15 | 64cded44ab |
hex | 389b2a5cbf |
243121413311 has 4 divisors (see below), whose sum is σ = 277853043792. Its totient is φ = 208389782832.
The previous prime is 243121413263. The next prime is 243121413317. The reversal of 243121413311 is 113314121342.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113314121342 = 2 ⋅56657060671.
It is not a de Polignac number, because 243121413311 - 218 = 243121151167 is a prime.
It is a super-2 number, since 2×2431214133112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243121413317) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17365815230 + ... + 17365815243.
It is an arithmetic number, because the mean of its divisors is an integer number (69463260948).
Almost surely, 2243121413311 is an apocalyptic number.
243121413311 is a deficient number, since it is larger than the sum of its proper divisors (34731630481).
243121413311 is an equidigital number, since it uses as much as digits as its factorization.
243121413311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34731630480.
The product of its digits is 1728, while the sum is 26.
Adding to 243121413311 its reverse (113314121342), we get a palindrome (356435534653).
The spelling of 243121413311 in words is "two hundred forty-three billion, one hundred twenty-one million, four hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.212 sec. • engine limits •