Base | Representation |
---|---|
bin | 1000010011001010011… |
… | …0100011101000111100 |
3 | 111122000211212020101111 |
4 | 2010302212203220330 |
5 | 4314002204422040 |
6 | 145300210051404 |
7 | 13205223362665 |
oct | 2046246435074 |
9 | 448024766344 |
10 | 142582889020 |
11 | 55518361970 |
12 | 23772879b64 |
13 | 105a3a237b0 |
14 | 6c8869836c |
15 | 3a97871dea |
hex | 21329a3a3c |
142582889020 has 384 divisors, whose sum is σ = 382491648000. Its totient is φ = 43867837440.
The previous prime is 142582888997. The next prime is 142582889051. The reversal of 142582889020 is 20988285241.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 324789961 + ... + 324790399.
It is an arithmetic number, because the mean of its divisors is an integer number (996072000).
Almost surely, 2142582889020 is an apocalyptic number.
142582889020 is a gapful number since it is divisible by the number (10) 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 142582889020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (191245824000).
142582889020 is an abundant number, since it is smaller than the sum of its proper divisors (239908758980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142582889020 is a wasteful number, since it uses less digits than its factorization.
142582889020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673 (or 671 counting only the distinct ones).
The product of its (nonzero) digits is 737280, while the sum is 49.
The spelling of 142582889020 in words is "one hundred forty-two billion, five hundred eighty-two million, eight hundred eighty-nine thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •