Base | Representation |
---|---|
bin | 101111011100101100001… |
… | …0101111111011011000100 |
3 | 212002102110121021211201202 |
4 | 1132321120111333123010 |
5 | 1323321001040441030 |
6 | 21511452323042032 |
7 | 1242100316534543 |
oct | 136713025773304 |
9 | 25072417254652 |
10 | 6521242515140 |
11 | 2094709433991 |
12 | 893a3ab10318 |
13 | 383c48414252 |
14 | 1878b633415a |
15 | b497496e745 |
hex | 5ee5857f6c4 |
6521242515140 has 12 divisors (see below), whose sum is σ = 13694609281836. Its totient is φ = 2608497006048.
The previous prime is 6521242515121. The next prime is 6521242515169. The reversal of 6521242515140 is 415152421256.
It can be written as a sum of positive squares in 2 ways, for example, as 4181346087556 + 2339896427584 = 2044834^2 + 1529672^2 .
It is a junction number, because it is equal to n+sod(n) for n = 6521242515094 and 6521242515103.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 163031062859 + ... + 163031062898.
It is an arithmetic number, because the mean of its divisors is an integer number (1141217440153).
Almost surely, 26521242515140 is an apocalyptic number.
It is an amenable number.
6521242515140 is an abundant number, since it is smaller than the sum of its proper divisors (7173366766696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6521242515140 is a wasteful number, since it uses less digits than its factorization.
6521242515140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326062125766 (or 326062125764 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 38.
Adding to 6521242515140 its reverse (415152421256), we get a palindrome (6936394936396).
The spelling of 6521242515140 in words is "six trillion, five hundred twenty-one billion, two hundred forty-two million, five hundred fifteen thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •