Base | Representation |
---|---|
bin | 11001101101110… |
… | …00110000011000 |
3 | 120000220110010112 |
4 | 30312320300120 |
5 | 420210333330 |
6 | 33223303452 |
7 | 5226355145 |
oct | 1466706030 |
9 | 500813115 |
10 | 215714840 |
11 | 100846830 |
12 | 602aab88 |
13 | 358ca123 |
14 | 209133cc |
15 | 13e10795 |
hex | cdb8c18 |
215714840 has 64 divisors (see below), whose sum is σ = 531061920. Its totient is φ = 78208000.
The previous prime is 215714831. The next prime is 215714867. The reversal of 215714840 is 48417512.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 215714797 and 215714806.
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 15 ways as a sum of consecutive naturals, for example, 228770 + ... + 229710.
Almost surely, 2215714840 is an apocalyptic number.
215714840 is a gapful number since it is divisible by the number (20) 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 215714840, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (265530960).
215714840 is an abundant number, since it is smaller than the sum of its proper divisors (315347080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215714840 is a wasteful number, since it uses less digits than its factorization.
215714840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1484 (or 1480 counting only the distinct ones).
The product of its (nonzero) digits is 8960, while the sum is 32.
The square root of 215714840 is about 14687.2339124833. The cubic root of 215714840 is about 599.7358466851.
The spelling of 215714840 in words is "two hundred fifteen million, seven hundred fourteen thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •