Base | Representation |
---|---|
bin | 111100010010111011111… |
… | …010010111101011000101 |
3 | 112200010002201100121021012 |
4 | 330102323322113223011 |
5 | 1020341342241122203 |
6 | 12451255332532005 |
7 | 605233551232040 |
oct | 74227372275305 |
9 | 15603081317235 |
10 | 4143501114053 |
11 | 13582813a35a4 |
12 | 56b056181005 |
13 | 240965b27142 |
14 | 104791939c57 |
15 | 72bae258bd8 |
hex | 3c4bbe97ac5 |
4143501114053 has 8 divisors (see below), whose sum is σ = 4744919688000. Its totient is φ = 3544455000960.
The previous prime is 4143501114043. The next prime is 4143501114061. The reversal of 4143501114053 is 3504111053414.
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 4143501114053 - 224 = 4143484336837 is a prime.
It is a super-2 number, since 2×41435011140532 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4143501114043) 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, 593111468 + ... + 593118453.
It is an arithmetic number, because the mean of its divisors is an integer number (593114961000).
Almost surely, 24143501114053 is an apocalyptic number.
It is an amenable number.
4143501114053 is a deficient number, since it is larger than the sum of its proper divisors (601418573947).
4143501114053 is a wasteful number, since it uses less digits than its factorization.
4143501114053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1186230427.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 4143501114053 its reverse (3504111053414), we get a palindrome (7647612167467).
The spelling of 4143501114053 in words is "four trillion, one hundred forty-three billion, five hundred one million, one hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •