Base | Representation |
---|---|
bin | 100101010100011111100… |
… | …110000010011000100111 |
3 | 100002011202011102011212002 |
4 | 211110133212002120213 |
5 | 314004323114300042 |
6 | 5242101145515515 |
7 | 353200545261362 |
oct | 45243746023047 |
9 | 10064664364762 |
10 | 2564625540647 |
11 | 8a9719292505 |
12 | 35505baa2b9b |
13 | 157ac652c911 |
14 | 8c1b29d10d9 |
15 | 46aa249e132 |
hex | 2551f982627 |
2564625540647 has 16 divisors (see below), whose sum is σ = 2817303582720. Its totient is φ = 2323741543200.
The previous prime is 2564625540629. The next prime is 2564625540649. The reversal of 2564625540647 is 7460455264652.
It is a cyclic number.
It is not a de Polignac number, because 2564625540647 - 26 = 2564625540583 is a prime.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2564625540592 and 2564625540601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2564625540649) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3522122 + ... + 4187432.
It is an arithmetic number, because the mean of its divisors is an integer number (176081473920).
Almost surely, 22564625540647 is an apocalyptic number.
2564625540647 is a deficient number, since it is larger than the sum of its proper divisors (252678042073).
2564625540647 is a wasteful number, since it uses less digits than its factorization.
2564625540647 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 674174.
The product of its (nonzero) digits is 48384000, while the sum is 56.
The spelling of 2564625540647 in words is "two trillion, five hundred sixty-four billion, six hundred twenty-five million, five hundred forty thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •