Base | Representation |
---|---|
bin | 10000111111111… |
… | …01100001111100 |
3 | 100221022122020111 |
4 | 20133331201330 |
5 | 243001034340 |
6 | 22052155404 |
7 | 3351022264 |
oct | 1037754174 |
9 | 327278214 |
10 | 142596220 |
11 | 73545718 |
12 | 3b908b64 |
13 | 23708c80 |
14 | 14d1c7a4 |
15 | c7baaea |
hex | 87fd87c |
142596220 has 48 divisors (see below), whose sum is σ = 323432928. Its totient is φ = 52496640.
The previous prime is 142596211. The next prime is 142596247. The reversal of 142596220 is 22695241.
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, 127102 + ... + 128218.
It is an arithmetic number, because the mean of its divisors is an integer number (6738186).
Almost surely, 2142596220 is an apocalyptic number.
142596220 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 142596220, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161716464).
142596220 is an abundant number, since it is smaller than the sum of its proper divisors (180836708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142596220 is a wasteful number, since it uses less digits than its factorization.
142596220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1630 (or 1628 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 142596220 is about 11941.3659185204. The cubic root of 142596220 is about 522.4394991111.
The spelling of 142596220 in words is "one hundred forty-two million, five hundred ninety-six thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •