Base | Representation |
---|---|
bin | 1110001001101100100… |
… | …1000110111000000001 |
3 | 212020112112002200202101 |
4 | 3202123021012320001 |
5 | 12440402440241023 |
6 | 303404355150401 |
7 | 23364523416433 |
oct | 3423311067001 |
9 | 766475080671 |
10 | 243121024513 |
11 | 9411a531144 |
12 | 3b1508a5401 |
13 | 19c06b7b2b3 |
14 | baa4d9a653 |
15 | 64cde591ad |
hex | 389b246e01 |
243121024513 has 4 divisors (see below), whose sum is σ = 243127055808. Its totient is φ = 243114993220.
The previous prime is 243121024507. The next prime is 243121024519. The reversal of 243121024513 is 315420121342.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (243121024507) and next prime (243121024519).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-243121024513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (243121024519) 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, 2954773 + ... + 3035938.
It is an arithmetic number, because the mean of its divisors is an integer number (60781763952).
Almost surely, 2243121024513 is an apocalyptic number.
It is an amenable number.
243121024513 is a deficient number, since it is larger than the sum of its proper divisors (6031295).
243121024513 is an equidigital number, since it uses as much as digits as its factorization.
243121024513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6031294.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 243121024513 its reverse (315420121342), we get a palindrome (558541145855).
The spelling of 243121024513 in words is "two hundred forty-three billion, one hundred twenty-one million, twenty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •