Base | Representation |
---|---|
bin | 1110001010100100001… |
… | …0101001101010110001 |
3 | 212021010202212220021112 |
4 | 3202221002221222301 |
5 | 12441342134304131 |
6 | 303443445203105 |
7 | 23403354452402 |
oct | 3425102515261 |
9 | 767122786245 |
10 | 243354213041 |
11 | 9422a122135 |
12 | 3b1b6a00495 |
13 | 19c43285984 |
14 | bac7d3b9a9 |
15 | 64e466c02b |
hex | 38a90a9ab1 |
243354213041 has 8 divisors (see below), whose sum is σ = 250735003584. Its totient is φ = 236015719920.
The previous prime is 243354213007. The next prime is 243354213059. The reversal of 243354213041 is 140312453342.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 243354213041 - 26 = 243354212977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 243354212989 and 243354213007.
It is not an unprimeable number, because it can be changed into a prime (243354212041) 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 7 ways as a sum of consecutive naturals, for example, 10562675 + ... + 10585688.
It is an arithmetic number, because the mean of its divisors is an integer number (31341875448).
Almost surely, 2243354213041 is an apocalyptic number.
It is an amenable number.
243354213041 is a deficient number, since it is larger than the sum of its proper divisors (7380790543).
243354213041 is a wasteful number, since it uses less digits than its factorization.
243354213041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21148711.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 243354213041 its reverse (140312453342), we get a palindrome (383666666383).
The spelling of 243354213041 in words is "two hundred forty-three billion, three hundred fifty-four million, two hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •