Base | Representation |
---|---|
bin | 111100010010100000100… |
… | …100111110110110110111 |
3 | 112200001220202102201222202 |
4 | 330102200210332312313 |
5 | 1020334422341210201 |
6 | 12451142031415115 |
7 | 605216312250422 |
oct | 74224044766667 |
9 | 15601822381882 |
10 | 4143042522551 |
11 | 1358066549a59 |
12 | 56ab4868449b |
13 | 2408c1b0ca1a |
14 | 10474aa829b9 |
15 | 72b83d6ec6b |
hex | 3c4a093edb7 |
4143042522551 has 4 divisors (see below), whose sum is σ = 4185754301232. Its totient is φ = 4100330743872.
The previous prime is 4143042522527. The next prime is 4143042522557. The reversal of 4143042522551 is 1552252403414.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4143042522551 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4143042522557) 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 3 ways as a sum of consecutive naturals, for example, 21355889195 + ... + 21355889388.
It is an arithmetic number, because the mean of its divisors is an integer number (1046438575308).
Almost surely, 24143042522551 is an apocalyptic number.
4143042522551 is a deficient number, since it is larger than the sum of its proper divisors (42711778681).
4143042522551 is an equidigital number, since it uses as much as digits as its factorization.
4143042522551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42711778680.
The product of its (nonzero) digits is 192000, while the sum is 38.
Adding to 4143042522551 its reverse (1552252403414), we get a palindrome (5695294925965).
The spelling of 4143042522551 in words is "four trillion, one hundred forty-three billion, forty-two million, five hundred twenty-two thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •