Base | Representation |
---|---|
bin | 1011001110011110100110… |
… | …0001110101111101111111 |
3 | 1121201000100220121210000201 |
4 | 2303213221201311331333 |
5 | 3104213144401121133 |
6 | 42130243313104331 |
7 | 2412530641261000 |
oct | 263475141657577 |
9 | 47630326553021 |
10 | 12343359004543 |
11 | 3a29875404a56 |
12 | 1474285b580a7 |
13 | 6b6c87471ba8 |
14 | 3095c94671a7 |
15 | 16612be21d7d |
hex | b39e9875f7f |
12343359004543 has 12 divisors (see below), whose sum is σ = 14394663641200. Its totient is φ = 10579966231800.
The previous prime is 12343359004541. The next prime is 12343359004597. The reversal of 12343359004543 is 34540095334321.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is not a de Polignac number, because 12343359004543 - 21 = 12343359004541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12343359004493 and 12343359004502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12343359004541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 64972593 + ... + 65162293.
Almost surely, 212343359004543 is an apocalyptic number.
12343359004543 is a deficient number, since it is larger than the sum of its proper divisors (2051304636657).
12343359004543 is an frugal number, since it uses more digits than its factorization.
12343359004543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379423 (or 189708 counting only the distinct ones).
The product of its (nonzero) digits is 2332800, while the sum is 46.
The spelling of 12343359004543 in words is "twelve trillion, three hundred forty-three billion, three hundred fifty-nine million, four thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •