Base | Representation |
---|---|
bin | 101010001001001000… |
… | …111110000111010101 |
3 | 11022210120210201202012 |
4 | 222021020332013111 |
5 | 1220133112100000 |
6 | 32442055154005 |
7 | 3161230634042 |
oct | 521110760725 |
9 | 138716721665 |
10 | 45250503125 |
11 | 18210802823 |
12 | 892a375905 |
13 | 4361a9b849 |
14 | 2293a3a1c9 |
15 | 129c921735 |
hex | a8923e1d5 |
45250503125 has 12 divisors (see below), whose sum is σ = 56559512772. Its totient is φ = 36200400000.
The previous prime is 45250503121. The next prime is 45250503157. The reversal of 45250503125 is 52130505254.
It can be written as a sum of positive squares in 6 ways, for example, as 36002026564 + 9248476561 = 189742^2 + 96169^2 .
It is not a de Polignac number, because 45250503125 - 22 = 45250503121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 45250503091 and 45250503100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45250503121) 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 11 ways as a sum of consecutive naturals, for example, 7236956 + ... + 7243205.
It is an arithmetic number, because the mean of its divisors is an integer number (4713292731).
Almost surely, 245250503125 is an apocalyptic number.
It is an amenable number.
45250503125 is a deficient number, since it is larger than the sum of its proper divisors (11309009647).
45250503125 is an frugal number, since it uses more digits than its factorization.
45250503125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14480186 (or 14480166 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 32.
The spelling of 45250503125 in words is "forty-five billion, two hundred fifty million, five hundred three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •