Base | Representation |
---|---|
bin | 1001010100001110… |
… | …1011100100000100 |
3 | 20110021122021121001 |
4 | 2111003223210010 |
5 | 20110144120202 |
6 | 1052052103044 |
7 | 115654123534 |
oct | 22503534404 |
9 | 6407567531 |
10 | 2500770052 |
11 | 107368a610 |
12 | 599604a84 |
13 | 30b13bac1 |
14 | 19a1b14c4 |
15 | e982dd87 |
hex | 950eb904 |
2500770052 has 48 divisors (see below), whose sum is σ = 4875780672. Its totient is φ = 1112762880.
The previous prime is 2500770017. The next prime is 2500770053.
2500770052 is nontrivially palindromic in base 10.
It is a self number, because there is not a number n which added to its sum of digits gives 2500770052.
It is not an unprimeable number, because it can be changed into a prime (2500770053) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 437203 + ... + 442885.
It is an arithmetic number, because the mean of its divisors is an integer number (101578764).
Almost surely, 22500770052 is an apocalyptic number.
2500770052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2500770052 is a deficient number, since it is larger than the sum of its proper divisors (2375010620).
2500770052 is a wasteful number, since it uses less digits than its factorization.
2500770052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5908 (or 5906 counting only the distinct ones).
The product of its (nonzero) digits is 4900, while the sum is 28.
The square root of 2500770052 is about 50007.6999271112. The cubic root of 2500770052 is about 1357.3481435067.
It can be divided in two parts, 25007 and 70052, that added together give a palindrome (95059).
The spelling of 2500770052 in words is "two billion, five hundred million, seven hundred seventy thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •