Base | Representation |
---|---|
bin | 100101000111100011000… |
… | …100001101100001110101 |
3 | 100000211212102100120220202 |
4 | 211013203010031201311 |
5 | 313242341113413144 |
6 | 5231441552010245 |
7 | 352166226641630 |
oct | 45074304154165 |
9 | 10024772316822 |
10 | 2550725138549 |
11 | 8a3835930695 |
12 | 352420830985 |
13 | 1566bc753513 |
14 | 8b654842c17 |
15 | 4653be9164e |
hex | 251e310d875 |
2550725138549 has 8 divisors (see below), whose sum is σ = 2915216703168. Its totient is φ = 2186259138720.
The previous prime is 2550725138531. The next prime is 2550725138561. The reversal of 2550725138549 is 9458315270552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2550725138549 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2550725138494 and 2550725138503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2550725158549) 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, 6176912 + ... + 6576905.
It is an arithmetic number, because the mean of its divisors is an integer number (364402087896).
Almost surely, 22550725138549 is an apocalyptic number.
It is an amenable number.
2550725138549 is a deficient number, since it is larger than the sum of its proper divisors (364491564619).
2550725138549 is a wasteful number, since it uses less digits than its factorization.
2550725138549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12782395.
The product of its (nonzero) digits is 15120000, while the sum is 56.
The spelling of 2550725138549 in words is "two trillion, five hundred fifty billion, seven hundred twenty-five million, one hundred thirty-eight thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •