Base | Representation |
---|---|
bin | 11100101101101… |
… | …10010010000000 |
3 | 121210020111020200 |
4 | 32112312102000 |
5 | 443130324103 |
6 | 35522405200 |
7 | 5653236303 |
oct | 1626662200 |
9 | 553214220 |
10 | 240870528 |
11 | 113a68658 |
12 | 68800800 |
13 | 3ab97152 |
14 | 23dc0b3a |
15 | 1622e0a3 |
hex | e5b6480 |
240870528 has 48 divisors (see below), whose sum is σ = 693133350. Its totient is φ = 80289792.
The previous prime is 240870473. The next prime is 240870529. The reversal of 240870528 is 825078042.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 212226624 + 28643904 = 14568^2 + 5352^2 .
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×2408705282 = 116037222517997568, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 240870492 and 240870501.
It is not an unprimeable number, because it can be changed into a prime (240870529) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 103393 + ... + 105696.
Almost surely, 2240870528 is an apocalyptic number.
It is an amenable number.
240870528 is an abundant number, since it is smaller than the sum of its proper divisors (452262822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
240870528 is a wasteful number, since it uses less digits than its factorization.
240870528 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209109 (or 209094 counting only the distinct ones).
The product of its (nonzero) digits is 35840, while the sum is 36.
The square root of 240870528 is about 15520.0041237108. The cubic root of 240870528 is about 622.1969648100.
The spelling of 240870528 in words is "two hundred forty million, eight hundred seventy thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •