Base | Representation |
---|---|
bin | 1110001010001001010… |
… | …0010101111100001001 |
3 | 212020211220121221000201 |
4 | 3202202110111330021 |
5 | 12441124300112223 |
6 | 303424335332201 |
7 | 23400514605436 |
oct | 3424224257411 |
9 | 766756557021 |
10 | 243241410313 |
11 | 94181486840 |
12 | 3b185081061 |
13 | 19c25aab9b5 |
14 | bab6d76b8d |
15 | 64d97d8ead |
hex | 38a2515f09 |
243241410313 has 4 divisors (see below), whose sum is σ = 265354265808. Its totient is φ = 221128554820.
The previous prime is 243241410299. The next prime is 243241410323. The reversal of 243241410313 is 313014142342.
It is a happy number.
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 a cyclic number.
It is not a de Polignac number, because 243241410313 - 25 = 243241410281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (243241410323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11056427731 + ... + 11056427752.
It is an arithmetic number, because the mean of its divisors is an integer number (66338566452).
Almost surely, 2243241410313 is an apocalyptic number.
It is an amenable number.
243241410313 is a deficient number, since it is larger than the sum of its proper divisors (22112855495).
243241410313 is a wasteful number, since it uses less digits than its factorization.
243241410313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22112855494.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 243241410313 its reverse (313014142342), we get a palindrome (556255552655).
The spelling of 243241410313 in words is "two hundred forty-three billion, two hundred forty-one million, four hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •