Base | Representation |
---|---|
bin | 10001000100111… |
… | …01110111011000 |
3 | 100222120000002220 |
4 | 20202131313120 |
5 | 243133043302 |
6 | 22114224040 |
7 | 3356426043 |
oct | 1042356730 |
9 | 328500086 |
10 | 143252952 |
11 | 73954077 |
12 | 3bb85020 |
13 | 238a8b7b |
14 | 1504dc5a |
15 | c89a4bc |
hex | 889ddd8 |
143252952 has 64 divisors (see below), whose sum is σ = 369684480. Its totient is φ = 46230912.
The previous prime is 143252939. The next prime is 143252981. The reversal of 143252952 is 259252341.
143252952 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 130518 + ... + 131610.
It is an arithmetic number, because the mean of its divisors is an integer number (5776320).
Almost surely, 2143252952 is an apocalyptic number.
143252952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 143252952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184842240).
143252952 is an abundant number, since it is smaller than the sum of its proper divisors (226431528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143252952 is a wasteful number, since it uses less digits than its factorization.
143252952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1272 (or 1268 counting only the distinct ones).
The product of its digits is 21600, while the sum is 33.
The square root of 143252952 is about 11968.8325245197. The cubic root of 143252952 is about 523.2403089239.
The spelling of 143252952 in words is "one hundred forty-three million, two hundred fifty-two thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •