Base | Representation |
---|---|
bin | 1001011110101101… |
… | …1100111000110000 |
3 | 20120100101200220202 |
4 | 2113223130320300 |
5 | 20202424001003 |
6 | 1100302454332 |
7 | 120030006404 |
oct | 22753347060 |
9 | 6510350822 |
10 | 2544750128 |
11 | 1096499488 |
12 | 5b02943a8 |
13 | 31729a10b |
14 | 1a1d7d104 |
15 | ed61a088 |
hex | 97adce30 |
2544750128 has 40 divisors (see below), whose sum is σ = 5240477088. Its totient is φ = 1192942592.
The previous prime is 2544750127. The next prime is 2544750149. The reversal of 2544750128 is 8210574452.
It is a junction number, because it is equal to n+sod(n) for n = 2544750091 and 2544750100.
It is not an unprimeable number, because it can be changed into a prime (2544750127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53750 + ... + 89322.
Almost surely, 22544750128 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2544750128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2620238544).
2544750128 is an abundant number, since it is smaller than the sum of its proper divisors (2695726960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2544750128 is a wasteful number, since it uses less digits than its factorization.
2544750128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35861 (or 35855 counting only the distinct ones).
The product of its (nonzero) digits is 89600, while the sum is 38.
The square root of 2544750128 is about 50445.5164310962. The cubic root of 2544750128 is about 1365.2590004401.
The spelling of 2544750128 in words is "two billion, five hundred forty-four million, seven hundred fifty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •