Base | Representation |
---|---|
bin | 100101010011001110011… |
… | …100001011000000000000 |
3 | 100002001020021102202012201 |
4 | 211103032130023000000 |
5 | 313444031041000000 |
6 | 5241314111202544 |
7 | 353122033336204 |
oct | 45231634130000 |
9 | 10061207382181 |
10 | 2563264000000 |
11 | 8a908a781900 |
12 | 35493bb16454 |
13 | 15793a428672 |
14 | 8c0c3c50b04 |
15 | 46a22ba496a |
hex | 254ce70b000 |
2563264000000 has 546 divisors, whose sum is σ = 7064007157676. Its totient is φ = 929280000000.
The previous prime is 2563263999991. The next prime is 2563264000007. The reversal of 2563264000000 is 4623652.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (2563264000007) by changing a digit.
It is a polite number, since it can be written in 41 ways as a sum of consecutive naturals, for example, 7743999835 + ... + 7744000165.
Almost surely, 22563264000000 is an apocalyptic number.
2563264000000 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 2563264000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3532003578838).
2563264000000 is an abundant number, since it is smaller than the sum of its proper divisors (4500743157676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2563264000000 is an frugal number, since it uses more digits than its factorization.
2563264000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407 (or 349 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 2563264000000 its reverse (4623652), we get a palindrome (2563268623652).
The spelling of 2563264000000 in words is "two trillion, five hundred sixty-three billion, two hundred sixty-four million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •