Base | Representation |
---|---|
bin | 100101001011110001011… |
… | …001100101001101011001 |
3 | 100001021120111121100010222 |
4 | 211023301121211031121 |
5 | 313331133202321024 |
6 | 5233512010245425 |
7 | 352416511431131 |
oct | 45136131451531 |
9 | 10037514540128 |
10 | 2555260588889 |
11 | 8a5752a94658 |
12 | 353287726875 |
13 | 156c6328ca48 |
14 | 8b964d39ac1 |
15 | 4670523385e |
hex | 252f1665359 |
2555260588889 has 8 divisors (see below), whose sum is σ = 2661283965888. Its totient is φ = 2451182595120.
The previous prime is 2555260588841. The next prime is 2555260588897. The reversal of 2555260588889 is 9888850625552.
2555260588889 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 2555260588889 - 240 = 1455748961113 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (71).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2555260588289) 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, 486343127 + ... + 486348380.
It is an arithmetic number, because the mean of its divisors is an integer number (332660495736).
Almost surely, 22555260588889 is an apocalyptic number.
It is an amenable number.
2555260588889 is a deficient number, since it is larger than the sum of its proper divisors (106023376999).
2555260588889 is an equidigital number, since it uses as much as digits as its factorization.
2555260588889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 972691615.
The product of its (nonzero) digits is 552960000, while the sum is 71.
The spelling of 2555260588889 in words is "two trillion, five hundred fifty-five billion, two hundred sixty million, five hundred eighty-eight thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •