Base | Representation |
---|---|
bin | 10001000110010… |
… | …01101000010101 |
3 | 100222220010000012 |
4 | 20203021220111 |
5 | 243204312323 |
6 | 22122130005 |
7 | 3361103501 |
oct | 1043115025 |
9 | 328803005 |
10 | 143432213 |
11 | 73a66821 |
12 | 40050905 |
13 | 2393c642 |
14 | 15099301 |
15 | c8d3678 |
hex | 88c9a15 |
143432213 has 8 divisors (see below), whose sum is σ = 151987608. Its totient is φ = 134889984.
The previous prime is 143432153. The next prime is 143432243. The reversal of 143432213 is 312234341.
It can be written as a sum of positive squares in 4 ways, for example, as 18037009 + 125395204 = 4247^2 + 11198^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 143432213 - 216 = 143366677 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 (143432243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27395 + ... + 32207.
It is an arithmetic number, because the mean of its divisors is an integer number (18998451).
Almost surely, 2143432213 is an apocalyptic number.
It is an amenable number.
143432213 is a deficient number, since it is larger than the sum of its proper divisors (8555395).
143432213 is a wasteful number, since it uses less digits than its factorization.
143432213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6583.
The product of its digits is 1728, while the sum is 23.
The square root of 143432213 is about 11976.3188417811. The cubic root of 143432213 is about 523.4584719296.
Adding to 143432213 its reverse (312234341), we get a palindrome (455666554).
The spelling of 143432213 in words is "one hundred forty-three million, four hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •