Base | Representation |
---|---|
bin | 1110001001101010011… |
… | …0110011111011100111 |
3 | 212020111220011221010021 |
4 | 3202122212303323213 |
5 | 12440343140042043 |
6 | 303403434340011 |
7 | 23364354123205 |
oct | 3423246637347 |
9 | 766456157107 |
10 | 243112034023 |
11 | 94115450491 |
12 | 3b14988a607 |
13 | 19c05051091 |
14 | baa3ada075 |
15 | 64cd2803ed |
hex | 389a9b3ee7 |
243112034023 has 4 divisors (see below), whose sum is σ = 251495207640. Its totient is φ = 234728860408.
The previous prime is 243112034017. The next prime is 243112034057. The reversal of 243112034023 is 320430211342.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-243112034023 is a prime.
It is a super-2 number, since 2×2431120340232 (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 (243112034093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4191586765 + ... + 4191586822.
It is an arithmetic number, because the mean of its divisors is an integer number (62873801910).
Almost surely, 2243112034023 is an apocalyptic number.
243112034023 is a deficient number, since it is larger than the sum of its proper divisors (8383173617).
243112034023 is an equidigital number, since it uses as much as digits as its factorization.
243112034023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8383173616.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 243112034023 its reverse (320430211342), we get a palindrome (563542245365).
The spelling of 243112034023 in words is "two hundred forty-three billion, one hundred twelve million, thirty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •