Base | Representation |
---|---|
bin | 110010001111010101000… |
… | …111110110001010001111 |
3 | 110020001100002022020020201 |
4 | 302033111013312022033 |
5 | 423031041142430133 |
6 | 11202005413354331 |
7 | 504300353500324 |
oct | 62172507661217 |
9 | 13201302266221 |
10 | 3452434342543 |
11 | 11111951aa76a |
12 | 4791313389a7 |
13 | 1c074235c324 |
14 | bd154c28b4b |
15 | 5ec1458dd7d |
hex | 323d51f628f |
3452434342543 has 8 divisors (see below), whose sum is σ = 3509707054176. Its totient is φ = 3395614380000.
The previous prime is 3452434342519. The next prime is 3452434342549.
3452434342543 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3452434342543 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3452434342493 and 3452434342502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3452434342549) 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, 113171896 + ... + 113202397.
It is an arithmetic number, because the mean of its divisors is an integer number (438713381772).
Almost surely, 23452434342543 is an apocalyptic number.
3452434342543 is a deficient number, since it is larger than the sum of its proper divisors (57272711633).
3452434342543 is a wasteful number, since it uses less digits than its factorization.
3452434342543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226374545.
The product of its digits is 8294400, while the sum is 46.
The spelling of 3452434342543 in words is "three trillion, four hundred fifty-two billion, four hundred thirty-four million, three hundred forty-two thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •