Base | Representation |
---|---|
bin | 100101010101010111101… |
… | …010000011000011010111 |
3 | 100002021011201021100202022 |
4 | 211111113222003003113 |
5 | 314013234411203210 |
6 | 5242334345403355 |
7 | 353233056112625 |
oct | 45252752030327 |
9 | 10067151240668 |
10 | 2565566116055 |
11 | 8aa061208758 |
12 | 355282a9955b |
13 | 157c16361a07 |
14 | 8c2618b0515 |
15 | 46b09d43155 |
hex | 25557a830d7 |
2565566116055 has 8 divisors (see below), whose sum is σ = 3079835449632. Its totient is φ = 2051682152608.
The previous prime is 2565566116051. The next prime is 2565566116067. The reversal of 2565566116055 is 5506116655652.
2565566116055 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2565566116055 - 22 = 2565566116051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2565566115988 and 2565566116006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2565566116051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96327884 + ... + 96354513.
It is an arithmetic number, because the mean of its divisors is an integer number (384979431204).
Almost surely, 22565566116055 is an apocalyptic number.
2565566116055 is a deficient number, since it is larger than the sum of its proper divisors (514269333577).
2565566116055 is a wasteful number, since it uses less digits than its factorization.
2565566116055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192685065.
The product of its (nonzero) digits is 8100000, while the sum is 53.
The spelling of 2565566116055 in words is "two trillion, five hundred sixty-five billion, five hundred sixty-six million, one hundred sixteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •