Base | Representation |
---|---|
bin | 100000100010011001010011… |
… | …101100000111110100011101 |
3 | 200202200100000101222210200122 |
4 | 200202121103230013310131 |
5 | 122224032100324142141 |
6 | 1224203425442204325 |
7 | 42066500160111314 |
oct | 4042312354076435 |
9 | 622610011883618 |
10 | 143101124443421 |
11 | 41661934123001 |
12 | 14071b590536a5 |
13 | 61b04bb9ab771 |
14 | 274a1ba70727b |
15 | 11825c6a2d64b |
hex | 822653b07d1d |
143101124443421 has 8 divisors (see below), whose sum is σ = 143359792488864. Its totient is φ = 142842654691120.
The previous prime is 143101124443369. The next prime is 143101124443439. The reversal of 143101124443421 is 124344421101341.
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 143101124443421 - 234 = 143083944574237 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 (143101124443721) 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, 48128615 + ... + 51015348.
It is an arithmetic number, because the mean of its divisors is an integer number (17919974061108).
Almost surely, 2143101124443421 is an apocalyptic number.
It is an amenable number.
143101124443421 is a deficient number, since it is larger than the sum of its proper divisors (258668045443).
143101124443421 is an equidigital number, since it uses as much as digits as its factorization.
143101124443421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 99146571.
The product of its (nonzero) digits is 36864, while the sum is 35.
Adding to 143101124443421 its reverse (124344421101341), we get a palindrome (267445545544762).
The spelling of 143101124443421 in words is "one hundred forty-three trillion, one hundred one billion, one hundred twenty-four million, four hundred forty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •