Base | Representation |
---|---|
bin | 10001000110101… |
… | …01010101001101 |
3 | 100222222112202022 |
4 | 20203111111031 |
5 | 243212331031 |
6 | 22123135525 |
7 | 3361363310 |
oct | 1043252515 |
9 | 328875668 |
10 | 143480141 |
11 | 73a99832 |
12 | 400745a5 |
13 | 239583bc |
14 | 150ac977 |
15 | c8e297b |
hex | 88d554d |
143480141 has 12 divisors (see below), whose sum is σ = 171421152. Its totient is φ = 117632856.
The previous prime is 143480131. The next prime is 143480147. The reversal of 143480141 is 141084341.
It is a de Polignac number, because none of the positive numbers 2k-143480141 is a prime.
It is a super-2 number, since 2×1434801412 = 41173101722759762, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 143480141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143480147) 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 11 ways as a sum of consecutive naturals, for example, 15671 + ... + 23076.
It is an arithmetic number, because the mean of its divisors is an integer number (14285096).
Almost surely, 2143480141 is an apocalyptic number.
It is an amenable number.
143480141 is a deficient number, since it is larger than the sum of its proper divisors (27941011).
143480141 is an equidigital number, since it uses as much as digits as its factorization.
143480141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38800 (or 38777 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 26.
The square root of 143480141 is about 11978.3196233862. The cubic root of 143480141 is about 523.5167701394.
The spelling of 143480141 in words is "one hundred forty-three million, four hundred eighty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •