Base | Representation |
---|---|
bin | 100101001100001100000… |
… | …010001011111011010101 |
3 | 100001022201122102202210201 |
4 | 211030030002023323111 |
5 | 313333042101101403 |
6 | 5234024212020501 |
7 | 352433545546420 |
oct | 45141402137325 |
9 | 10038648382721 |
10 | 2555707440853 |
11 | 8a59622500a6 |
12 | 353391301731 |
13 | 157004a268a8 |
14 | 8b9a84189b7 |
15 | 4672e59e21d |
hex | 2530c08bed5 |
2555707440853 has 8 divisors (see below), whose sum is σ = 2920860927872. Its totient is φ = 2190567059856.
The previous prime is 2555707440817. The next prime is 2555707440877. The reversal of 2555707440853 is 3580447075552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2555707440853 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2555707440794 and 2555707440803.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2555707440893) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2855025 + ... + 3641782.
It is an arithmetic number, because the mean of its divisors is an integer number (365107615984).
Almost surely, 22555707440853 is an apocalyptic number.
It is an amenable number.
2555707440853 is a deficient number, since it is larger than the sum of its proper divisors (365153487019).
2555707440853 is an equidigital number, since it uses as much as digits as its factorization.
2555707440853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6553011.
The product of its (nonzero) digits is 23520000, while the sum is 55.
The spelling of 2555707440853 in words is "two trillion, five hundred fifty-five billion, seven hundred seven million, four hundred forty thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •