Base | Representation |
---|---|
bin | 10001000111001… |
… | …10111010001101 |
3 | 101000010012111222 |
4 | 20203212322031 |
5 | 243222132031 |
6 | 22124453125 |
7 | 3362113235 |
oct | 1043467215 |
9 | 330105458 |
10 | 143552141 |
11 | 74038937 |
12 | 400aa1a5 |
13 | 239820c5 |
14 | 150cacc5 |
15 | c908e7b |
hex | 88e6e8d |
143552141 has 4 divisors (see below), whose sum is σ = 143683392. Its totient is φ = 143420892.
The previous prime is 143552137. The next prime is 143552153. The reversal of 143552141 is 141255341.
143552141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 143552141 - 22 = 143552137 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 143552141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143552741) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63971 + ... + 66176.
It is an arithmetic number, because the mean of its divisors is an integer number (35920848).
Almost surely, 2143552141 is an apocalyptic number.
It is an amenable number.
143552141 is a deficient number, since it is larger than the sum of its proper divisors (131251).
143552141 is a wasteful number, since it uses less digits than its factorization.
143552141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131250.
The product of its digits is 2400, while the sum is 26.
The square root of 143552141 is about 11981.3246763453. The cubic root of 143552141 is about 523.6043244262.
The spelling of 143552141 in words is "one hundred forty-three million, five hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •