Base | Representation |
---|---|
bin | 10000111100100… |
… | …00110010000000 |
3 | 100220111000012212 |
4 | 20132100302000 |
5 | 242342311114 |
6 | 22034441252 |
7 | 3344155526 |
oct | 1036206200 |
9 | 326430185 |
10 | 142150784 |
11 | 73270a96 |
12 | 3b733228 |
13 | 235b12b9 |
14 | 14c44316 |
15 | c72db3e |
hex | 8790c80 |
142150784 has 48 divisors (see below), whose sum is σ = 288809430. Its totient is φ = 69685248.
The previous prime is 142150777. The next prime is 142150807. The reversal of 142150784 is 487051241.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 123832384 + 18318400 = 11128^2 + 4280^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 142150784.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1328459 + ... + 1328565.
Almost surely, 2142150784 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 142150784, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144404715).
142150784 is an abundant number, since it is smaller than the sum of its proper divisors (146658646).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142150784 is an frugal number, since it uses more digits than its factorization.
142150784 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325 (or 206 counting only the distinct ones).
The product of its (nonzero) digits is 8960, while the sum is 32.
The square root of 142150784 is about 11922.7003652696. The cubic root of 142150784 is about 521.8949402734.
The spelling of 142150784 in words is "one hundred forty-two million, one hundred fifty thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •