Base | Representation |
---|---|
bin | 10000111100100… |
… | …00010101101000 |
3 | 100220110220201121 |
4 | 20132100111220 |
5 | 242342231333 |
6 | 22034425024 |
7 | 3344150323 |
oct | 1036202550 |
9 | 326426647 |
10 | 142148968 |
11 | 7326a695 |
12 | 3b732174 |
13 | 235b0520 |
14 | 14c437ba |
15 | c72d32d |
hex | 8790568 |
142148968 has 128 divisors (see below), whose sum is σ = 325775520. Its totient is φ = 57507840.
The previous prime is 142148957. The next prime is 142148977. The reversal of 142148968 is 869841241.
142148968 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 16 ways, for example, as 22071204 + 120077764 = 4698^2 + 10958^2 .
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2682030 + ... + 2682082.
Almost surely, 2142148968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 142148968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162887760).
142148968 is an abundant number, since it is smaller than the sum of its proper divisors (183626552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142148968 is a wasteful number, since it uses less digits than its factorization.
142148968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167 (or 163 counting only the distinct ones).
The product of its digits is 110592, while the sum is 43.
The square root of 142148968 is about 11922.6242077824. The cubic root of 142148968 is about 521.8927178323.
The spelling of 142148968 in words is "one hundred forty-two million, one hundred forty-eight thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •