Base | Representation |
---|---|
bin | 1000010101001000100… |
… | …1000101000010100101 |
3 | 111200101201112111200020 |
4 | 2011102021011002211 |
5 | 4321043140014141 |
6 | 145424511305353 |
7 | 13224310130061 |
oct | 2052211050245 |
9 | 450351474606 |
10 | 143112032421 |
11 | 5576a014166 |
12 | 2389bb1b259 |
13 | 106595409b7 |
14 | 6cd8a78aa1 |
15 | 3ac9045266 |
hex | 21522450a5 |
143112032421 has 8 divisors (see below), whose sum is σ = 190819557120. Its totient is φ = 95406264672.
The previous prime is 143112032381. The next prime is 143112032423. The reversal of 143112032421 is 124230211341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 143112032421 - 210 = 143112031397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 143112032391 and 143112032400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143112032423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 235701 + ... + 584618.
It is an arithmetic number, because the mean of its divisors is an integer number (23852444640).
Almost surely, 2143112032421 is an apocalyptic number.
It is an amenable number.
143112032421 is a deficient number, since it is larger than the sum of its proper divisors (47707524699).
143112032421 is an equidigital number, since it uses as much as digits as its factorization.
143112032421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 878475.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 143112032421 its reverse (124230211341), we get a palindrome (267342243762).
The spelling of 143112032421 in words is "one hundred forty-three billion, one hundred twelve million, thirty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •