Base | Representation |
---|---|
bin | 10001000000011… |
… | …10100101000000 |
3 | 100221110012000201 |
4 | 20200032211000 |
5 | 243010303143 |
6 | 22053454544 |
7 | 3351433000 |
oct | 1040164500 |
9 | 327405021 |
10 | 142666048 |
11 | 73593128 |
12 | 3b941454 |
13 | 237319a5 |
14 | 14d3a000 |
15 | c7d164d |
hex | 880e940 |
142666048 has 112 divisors (see below), whose sum is σ = 338531200. Its totient is φ = 59609088.
The previous prime is 142666039. The next prime is 142666049. The reversal of 142666048 is 840666241.
It is a tau number, because it is divible by the number of its divisors (112).
It is a junction number, because it is equal to n+sod(n) for n = 142665998 and 142666016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142666049) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1470736 + ... + 1470832.
It is an arithmetic number, because the mean of its divisors is an integer number (3022600).
Almost surely, 2142666048 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 142666048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169265600).
142666048 is an abundant number, since it is smaller than the sum of its proper divisors (195865152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142666048 is an frugal number, since it uses more digits than its factorization.
142666048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197 (or 173 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 37.
The square root of 142666048 is about 11944.2893467967. The cubic root of 142666048 is about 522.5247630641.
The spelling of 142666048 in words is "one hundred forty-two million, six hundred sixty-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •