Base | Representation |
---|---|
bin | 1001011110111001… |
… | …0100000110000000 |
3 | 20120101210211021221 |
4 | 2113232110012000 |
5 | 20203122004134 |
6 | 1100330524424 |
7 | 120036253246 |
oct | 22756240600 |
9 | 6511724257 |
10 | 2545500544 |
11 | 1096961264 |
12 | 5b0596714 |
13 | 3174a0852 |
14 | 1a20d6796 |
15 | ed7175b4 |
hex | 97b94180 |
2545500544 has 64 divisors (see below), whose sum is σ = 5257018800. Its totient is φ = 1226741760.
The previous prime is 2545500493. The next prime is 2545500569. The reversal of 2545500544 is 4450055452.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 513759 + ... + 518689.
Almost surely, 22545500544 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 2545500544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2628509400).
2545500544 is an abundant number, since it is smaller than the sum of its proper divisors (2711518256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2545500544 is a wasteful number, since it uses less digits than its factorization.
2545500544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5091 (or 5079 counting only the distinct ones).
The product of its (nonzero) digits is 80000, while the sum is 34.
The square root of 2545500544 is about 50452.9537688330. The cubic root of 2545500544 is about 1365.3931867004.
Adding to 2545500544 its reverse (4450055452), we get a palindrome (6995555996).
The spelling of 2545500544 in words is "two billion, five hundred forty-five million, five hundred thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •