Base | Representation |
---|---|
bin | 1110001001101111001… |
… | …1001011111100101110 |
3 | 212020120021212010012121 |
4 | 3202123303023330232 |
5 | 12440413301232332 |
6 | 303405431423154 |
7 | 23365016241331 |
oct | 3423363137456 |
9 | 766507763177 |
10 | 243132055342 |
11 | 94125785830 |
12 | 3b154524aba |
13 | 19c09241107 |
14 | baa662c618 |
15 | 64cedd7797 |
hex | 389bccbf2e |
243132055342 has 16 divisors (see below), whose sum is σ = 397880622000. Its totient is φ = 110506746240.
The previous prime is 243132055307. The next prime is 243132055343. The reversal of 243132055342 is 243550231342.
It is a super-2 number, since 2×2431320553422 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 243132055298 and 243132055307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243132055343) 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 7 ways as a sum of consecutive naturals, for example, 67467 + ... + 700582.
It is an arithmetic number, because the mean of its divisors is an integer number (24867538875).
Almost surely, 2243132055342 is an apocalyptic number.
243132055342 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
243132055342 is a deficient number, since it is larger than the sum of its proper divisors (154748566658).
243132055342 is a wasteful number, since it uses less digits than its factorization.
243132055342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 782451.
The product of its (nonzero) digits is 86400, while the sum is 34.
Adding to 243132055342 its reverse (243550231342), we get a palindrome (486682286684).
The spelling of 243132055342 in words is "two hundred forty-three billion, one hundred thirty-two million, fifty-five thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •