Base | Representation |
---|---|
bin | 1000010011001001100… |
… | …0011111111001110100 |
3 | 111122000120221000002011 |
4 | 2010302120133321310 |
5 | 4314000234004300 |
6 | 145255555054004 |
7 | 13205150143423 |
oct | 2046230377164 |
9 | 448016830064 |
10 | 142579203700 |
11 | 5551627504a |
12 | 237715a1304 |
13 | 105a303322b |
14 | 6c87db92ba |
15 | 3a97394eba |
hex | 213261fe74 |
142579203700 has 36 divisors (see below), whose sum is σ = 309417383520. Its totient is φ = 57027900640.
The previous prime is 142579203671. The next prime is 142579203703. The reversal of 142579203700 is 7302975241.
142579203700 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142579203703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1846059 + ... + 1921741.
It is an arithmetic number, because the mean of its divisors is an integer number (8594927320).
Almost surely, 2142579203700 is an apocalyptic number.
142579203700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142579203700 is an abundant number, since it is smaller than the sum of its proper divisors (166838179820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142579203700 is a wasteful number, since it uses less digits than its factorization.
142579203700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94536 (or 94529 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 40.
The spelling of 142579203700 in words is "one hundred forty-two billion, five hundred seventy-nine million, two hundred three thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •