Base | Representation |
---|---|
bin | 101010001001101000101… |
… | …101001111110000110101 |
3 | 101020220112120102000120200 |
4 | 222021220231033300311 |
5 | 334424131022232023 |
6 | 10054355144551113 |
7 | 416161400165040 |
oct | 52115055176065 |
9 | 11226476360520 |
10 | 2896564649013 |
11 | a1747625a632 |
12 | 3a9459782499 |
13 | 1801b639abc9 |
14 | a02a1905c57 |
15 | 5052db1c743 |
hex | 2a268b4fc35 |
2896564649013 has 48 divisors (see below), whose sum is σ = 4948566604800. Its totient is φ = 1597668779520.
The previous prime is 2896564649003. The next prime is 2896564649053. The reversal of 2896564649013 is 3109464656982.
2896564649013 is a `hidden beast` number, since 2 + 8 + 9 + 6 + 564 + 64 + 9 + 0 + 1 + 3 = 666.
2896564649013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2896564649013 - 29 = 2896564648501 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2896564649003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1146628 + ... + 2666061.
It is an arithmetic number, because the mean of its divisors is an integer number (103095137600).
Almost surely, 22896564649013 is an apocalyptic number.
It is an amenable number.
2896564649013 is a deficient number, since it is larger than the sum of its proper divisors (2052001955787).
2896564649013 is a wasteful number, since it uses less digits than its factorization.
2896564649013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3813122 (or 3813119 counting only the distinct ones).
The product of its (nonzero) digits is 67184640, while the sum is 63.
The spelling of 2896564649013 in words is "two trillion, eight hundred ninety-six billion, five hundred sixty-four million, six hundred forty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •