Base | Representation |
---|---|
bin | 1111001000000110… |
… | …0101010101001101 |
3 | 101110222112211122222 |
4 | 3302001211111031 |
5 | 31303442020300 |
6 | 1510530345125 |
7 | 202423456166 |
oct | 36201452515 |
9 | 11428484588 |
10 | 4060501325 |
11 | 17a4057821 |
12 | 953a2b1a5 |
13 | 4c931590a |
14 | 2a73c276d |
15 | 18b726785 |
hex | f206554d |
4060501325 has 12 divisors (see below), whose sum is σ = 5036466708. Its totient is φ = 3247468800.
The previous prime is 4060501321. The next prime is 4060501337. The reversal of 4060501325 is 5231050604.
It can be written as a sum of positive squares in 6 ways, for example, as 1299314116 + 2761187209 = 36046^2 + 52547^2 .
It is not a de Polignac number, because 4060501325 - 22 = 4060501321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4060501294 and 4060501303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4060501321) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 73415 + ... + 116235.
It is an arithmetic number, because the mean of its divisors is an integer number (419705559).
Almost surely, 24060501325 is an apocalyptic number.
It is an amenable number.
4060501325 is a deficient number, since it is larger than the sum of its proper divisors (975965383).
4060501325 is a wasteful number, since it uses less digits than its factorization.
4060501325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46624 (or 46619 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
The square root of 4060501325 is about 63722.0630943475. The cubic root of 4060501325 is about 1595.3643589335.
Adding to 4060501325 its reverse (5231050604), we get a palindrome (9291551929).
The spelling of 4060501325 in words is "four billion, sixty million, five hundred one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •