Base | Representation |
---|---|
bin | 111010101101000000010… |
… | …011000101001000101111 |
3 | 112021122121002111002110202 |
4 | 322231000103011020233 |
5 | 1012043220034101133 |
6 | 12325115100424115 |
7 | 564310411012160 |
oct | 72550023051057 |
9 | 15248532432422 |
10 | 4034053034543 |
11 | 1315917852524 |
12 | 5519b024803b |
13 | 233542a9090c |
14 | dd36bb85767 |
15 | 6ee058332e8 |
hex | 3ab404c522f |
4034053034543 has 8 divisors (see below), whose sum is σ = 4610363523360. Its totient is φ = 3457746845280.
The previous prime is 4034053034437. The next prime is 4034053034567. The reversal of 4034053034543 is 3454303504304.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4034053034543 - 220 = 4034051985967 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4034053034497 and 4034053034506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4034059034543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1279433 + ... + 3115293.
It is an arithmetic number, because the mean of its divisors is an integer number (576295440420).
Almost surely, 24034053034543 is an apocalyptic number.
4034053034543 is a deficient number, since it is larger than the sum of its proper divisors (576310488817).
4034053034543 is a wasteful number, since it uses less digits than its factorization.
4034053034543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2149777.
The product of its (nonzero) digits is 518400, while the sum is 38.
Adding to 4034053034543 its reverse (3454303504304), we get a palindrome (7488356538847).
The spelling of 4034053034543 in words is "four trillion, thirty-four billion, fifty-three million, thirty-four thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •