Base | Representation |
---|---|
bin | 1000010001110010100… |
… | …1100001010011010100 |
3 | 111121002011210112201210 |
4 | 2010130221201103110 |
5 | 4312223412121444 |
6 | 145155451421420 |
7 | 13163131606140 |
oct | 2043451412324 |
9 | 447064715653 |
10 | 142214567124 |
11 | 55349463203 |
12 | 2368b454870 |
13 | 10545623c46 |
14 | 6c517bc220 |
15 | 3a753697b9 |
hex | 211ca614d4 |
142214567124 has 48 divisors (see below), whose sum is σ = 401547017088. Its totient is φ = 38242572288.
The previous prime is 142214567119. The next prime is 142214567129. The reversal of 142214567124 is 421765412241.
It is an interprime number because it is at equal distance from previous prime (142214567119) and next prime (142214567129).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142214567129) 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, 49793589 + ... + 49796444.
It is an arithmetic number, because the mean of its divisors is an integer number (8365562856).
Almost surely, 2142214567124 is an apocalyptic number.
142214567124 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
142214567124 is an abundant number, since it is smaller than the sum of its proper divisors (259332449964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142214567124 is a wasteful number, since it uses less digits than its factorization.
142214567124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99590064 (or 99590062 counting only the distinct ones).
The product of its digits is 107520, while the sum is 39.
Adding to 142214567124 its reverse (421765412241), we get a palindrome (563979979365).
The spelling of 142214567124 in words is "one hundred forty-two billion, two hundred fourteen million, five hundred sixty-seven thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •