Base | Representation |
---|---|
bin | 10001000011011… |
… | …01111000100101 |
3 | 100222012000111222 |
4 | 20201231320211 |
5 | 243110301141 |
6 | 22110110125 |
7 | 3354650054 |
oct | 1041557045 |
9 | 328160458 |
10 | 143056421 |
11 | 7382a452 |
12 | 3baab345 |
13 | 2383a591 |
14 | 14ddc39b |
15 | c85c14b |
hex | 886de25 |
143056421 has 8 divisors (see below), whose sum is σ = 148556184. Its totient is φ = 137652480.
The previous prime is 143056387. The next prime is 143056429. The reversal of 143056421 is 124650341.
It can be written as a sum of positive squares in 4 ways, for example, as 2515396 + 140541025 = 1586^2 + 11855^2 .
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 143056421 - 26 = 143056357 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 (143056429) 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, 20906 + ... + 26891.
It is an arithmetic number, because the mean of its divisors is an integer number (18569523).
Almost surely, 2143056421 is an apocalyptic number.
It is an amenable number.
143056421 is a deficient number, since it is larger than the sum of its proper divisors (5499763).
143056421 is an equidigital number, since it uses as much as digits as its factorization.
143056421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47911.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 143056421 is about 11960.6195909744. The cubic root of 143056421 is about 523.0009188528. Note that the first 3 decimals are identical.
The spelling of 143056421 in words is "one hundred forty-three million, fifty-six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •