Base | Representation |
---|---|
bin | 110000001111111010101… |
… | …1100111101000000000100 |
3 | 212110221102101120102020010 |
4 | 1200133311130331000010 |
5 | 1332121301122424130 |
6 | 22034204431510220 |
7 | 1253043422422260 |
oct | 140376534750004 |
9 | 25427371512203 |
10 | 6631252545540 |
11 | 2127331204a87 |
12 | 8b1221088370 |
13 | 39142aa137ac |
14 | 18cd509a90a0 |
15 | b77628990b0 |
hex | 607f573d004 |
6631252545540 has 48 divisors (see below), whose sum is σ = 21220008147072. Its totient is φ = 1515714867456.
The previous prime is 6631252545529. The next prime is 6631252545551. The reversal of 6631252545540 is 455452521366.
It is an interprime number because it is at equal distance from previous prime (6631252545529) and next prime (6631252545551).
It is a self number, because there is not a number n which added to its sum of digits gives 6631252545540.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7894347849 + ... + 7894348688.
It is an arithmetic number, because the mean of its divisors is an integer number (442083503064).
Almost surely, 26631252545540 is an apocalyptic number.
6631252545540 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6631252545540 is an abundant number, since it is smaller than the sum of its proper divisors (14588755601532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6631252545540 is a wasteful number, since it uses less digits than its factorization.
6631252545540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15788696556 (or 15788696554 counting only the distinct ones).
The product of its (nonzero) digits is 4320000, while the sum is 48.
The spelling of 6631252545540 in words is "six trillion, six hundred thirty-one billion, two hundred fifty-two million, five hundred forty-five thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •