Base | Representation |
---|---|
bin | 111100101101101111100110… |
… | …0100011010110001001010111 |
3 | 2121000220220222110122011100001 |
4 | 1321123133030203112021113 |
5 | 1024444404110334214333 |
6 | 5131500204334232131 |
7 | 220330011023644510 |
oct | 17133371443261127 |
9 | 2530826873564301 |
10 | 534052550304343 |
11 | 145190461a1a984 |
12 | 4ba92b66655647 |
13 | 19bcbc29b315b5 |
14 | 95c43d205da07 |
15 | 41b1debd8cb7d |
hex | 1e5b7cc8d6257 |
534052550304343 has 8 divisors (see below), whose sum is σ = 610876046131200. Its totient is φ = 457361623066200.
The previous prime is 534052550304337. The next prime is 534052550304359. The reversal of 534052550304343 is 343403055250435.
It is a happy number.
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 534052550304343 - 213 = 534052550296151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 534052550304293 and 534052550304302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (534052550104343) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33142138543 + ... + 33142154656.
It is an arithmetic number, because the mean of its divisors is an integer number (76359505766400).
Almost surely, 2534052550304343 is an apocalyptic number.
534052550304343 is a deficient number, since it is larger than the sum of its proper divisors (76823495826857).
534052550304343 is a wasteful number, since it uses less digits than its factorization.
534052550304343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66284294357.
The product of its (nonzero) digits is 6480000, while the sum is 46.
The spelling of 534052550304343 in words is "five hundred thirty-four trillion, fifty-two billion, five hundred fifty million, three hundred four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •