Base | Representation |
---|---|
bin | 1000010010111001001… |
… | …0100101010101011100 |
3 | 111121211210201201222110 |
4 | 2010232102211111130 |
5 | 4313330144403340 |
6 | 145245103314020 |
7 | 13203354432132 |
oct | 2045622452534 |
9 | 447753651873 |
10 | 142510544220 |
11 | 5549053a180 |
12 | 237525ab910 |
13 | 10591a43915 |
14 | 6c7cc25752 |
15 | 3a91331680 |
hex | 212e4a555c |
142510544220 has 48 divisors (see below), whose sum is σ = 435304937088. Its totient is φ = 34548010560.
The previous prime is 142510544207. The next prime is 142510544269. The reversal of 142510544220 is 22445015241.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 15 ways as a sum of consecutive naturals, for example, 107961874 + ... + 107963193.
It is an arithmetic number, because the mean of its divisors is an integer number (9068852856).
Almost surely, 2142510544220 is an apocalyptic number.
142510544220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142510544220 is an abundant number, since it is smaller than the sum of its proper divisors (292794392868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142510544220 is a wasteful number, since it uses less digits than its factorization.
142510544220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215925090 (or 215925088 counting only the distinct ones).
The product of its (nonzero) digits is 12800, while the sum is 30.
Adding to 142510544220 its reverse (22445015241), we get a palindrome (164955559461).
The spelling of 142510544220 in words is "one hundred forty-two billion, five hundred ten million, five hundred forty-four thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •