Base | Representation |
---|---|
bin | 10000111101001… |
… | …11000110011000 |
3 | 100220122122121122 |
4 | 20132213012120 |
5 | 242403222300 |
6 | 22040424412 |
7 | 3345016202 |
oct | 1036470630 |
9 | 326578548 |
10 | 142242200 |
11 | 73323741 |
12 | 3b778108 |
13 | 23613aa9 |
14 | 14c69772 |
15 | c74ac85 |
hex | 87a7198 |
142242200 has 48 divisors (see below), whose sum is σ = 332021160. Its totient is φ = 56672000.
The previous prime is 142242173. The next prime is 142242211. The reversal of 142242200 is 2242241.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 54935 + ... + 57465.
Almost surely, 2142242200 is an apocalyptic number.
142242200 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 142242200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166010580).
142242200 is an abundant number, since it is smaller than the sum of its proper divisors (189778960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142242200 is a wasteful number, since it uses less digits than its factorization.
142242200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2828 (or 2819 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 17.
The square root of 142242200 is about 11926.5334443836. The cubic root of 142242200 is about 522.0067917477.
Adding to 142242200 its reverse (2242241), we get a palindrome (144484441).
The spelling of 142242200 in words is "one hundred forty-two million, two hundred forty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •