Base | Representation |
---|---|
bin | 100101000111001010000… |
… | …011100111100010001101 |
3 | 100000210210011211102002122 |
4 | 211013022003213202031 |
5 | 313241011210140100 |
6 | 5231332202502325 |
7 | 352152643344023 |
oct | 45071203474215 |
9 | 10023704742078 |
10 | 2550305552525 |
11 | 8a363aaa8485 |
12 | 3523242049a5 |
13 | 156653845073 |
14 | 8b614c20713 |
15 | 4651520e985 |
hex | 251ca0e788d |
2550305552525 has 24 divisors (see below), whose sum is σ = 3194365928448. Its totient is φ = 2019616200000.
The previous prime is 2550305552477. The next prime is 2550305552563. The reversal of 2550305552525 is 5252555030552.
It is not a de Polignac number, because 2550305552525 - 222 = 2550301358221 is a prime.
It is a super-2 number, since 2×25503055525252 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 12093740 + ... + 12302810.
It is an arithmetic number, because the mean of its divisors is an integer number (133098580352).
Almost surely, 22550305552525 is an apocalyptic number.
2550305552525 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2550305552525 is a deficient number, since it is larger than the sum of its proper divisors (644060375923).
2550305552525 is a wasteful number, since it uses less digits than its factorization.
2550305552525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214013 (or 214008 counting only the distinct ones).
The product of its (nonzero) digits is 1875000, while the sum is 44.
The spelling of 2550305552525 in words is "two trillion, five hundred fifty billion, three hundred five million, five hundred fifty-two thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •