Base | Representation |
---|---|
bin | 10000111011111… |
… | …00010101100000 |
3 | 100220022202100020 |
4 | 20131330111200 |
5 | 242332121130 |
6 | 22032553440 |
7 | 3343356423 |
oct | 1035742540 |
9 | 326282306 |
10 | 142067040 |
11 | 73214085 |
12 | 3b6b2880 |
13 | 2358214b |
14 | 14c219ba |
15 | c713e10 |
hex | 877c560 |
142067040 has 48 divisors (see below), whose sum is σ = 447512688. Its totient is φ = 37884416.
The previous prime is 142067039. The next prime is 142067053. The reversal of 142067040 is 40760241.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 142067040.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 147507 + ... + 148466.
It is an arithmetic number, because the mean of its divisors is an integer number (9323181).
Almost surely, 2142067040 is an apocalyptic number.
142067040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142067040 is an abundant number, since it is smaller than the sum of its proper divisors (305445648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142067040 is a wasteful number, since it uses less digits than its factorization.
142067040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295991 (or 295983 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 24.
The square root of 142067040 is about 11919.1878917987. The cubic root of 142067040 is about 521.7924337328.
The spelling of 142067040 in words is "one hundred forty-two million, sixty-seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •