Base | Representation |
---|---|
bin | 111010001001… |
… | …001111011000 |
3 | 1001200101100221 |
4 | 322021033120 |
5 | 12400222300 |
6 | 1302405424 |
7 | 243361621 |
oct | 72111730 |
9 | 31611327 |
10 | 15242200 |
11 | 8670766 |
12 | 5130874 |
13 | 320896c |
14 | 204aa48 |
15 | 151131a |
hex | e893d8 |
15242200 has 48 divisors (see below), whose sum is σ = 37531080. Its totient is φ = 5736960.
The previous prime is 15242189. The next prime is 15242207. The reversal of 15242200 is 224251.
15242200 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 (15242207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1159 + ... + 5641.
Almost surely, 215242200 is an apocalyptic number.
15242200 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 15242200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18765540).
15242200 is an abundant number, since it is smaller than the sum of its proper divisors (22288880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15242200 is a wasteful number, since it uses less digits than its factorization.
15242200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4516 (or 4507 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 16.
The square root of 15242200 is about 3904.1260225561. The cubic root of 15242200 is about 247.9414967794.
Adding to 15242200 its reverse (224251), we get a palindrome (15466451).
The spelling of 15242200 in words is "fifteen million, two hundred forty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •