Base | Representation |
---|---|
bin | 11100101001010… |
… | …110100000001101 |
3 | 1020111100010011201 |
4 | 130221112200031 |
5 | 1441013232000 |
6 | 115404545501 |
7 | 14624023243 |
oct | 3451264015 |
9 | 1214303151 |
10 | 480602125 |
11 | 227318543 |
12 | 114b52291 |
13 | 78752a73 |
14 | 47b86793 |
15 | 2c2d596a |
hex | 1ca5680d |
480602125 has 16 divisors (see below), whose sum is σ = 602063280. Its totient is φ = 383025600.
The previous prime is 480602113. The next prime is 480602149. The reversal of 480602125 is 521206084.
It can be written as a sum of positive squares in 8 ways, for example, as 427414276 + 53187849 = 20674^2 + 7293^2 .
It is a de Polignac number, because none of the positive numbers 2k-480602125 is a prime.
It is a super-3 number, since 3×4806021253 (a number of 27 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 480602093 and 480602102.
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 15 ways as a sum of consecutive naturals, for example, 26479 + ... + 40771.
It is an arithmetic number, because the mean of its divisors is an integer number (37628955).
Almost surely, 2480602125 is an apocalyptic number.
It is an amenable number.
480602125 is a deficient number, since it is larger than the sum of its proper divisors (121461155).
480602125 is a wasteful number, since it uses less digits than its factorization.
480602125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14577 (or 14567 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
The square root of 480602125 is about 21922.6395536669. The cubic root of 480602125 is about 783.3007858314.
The spelling of 480602125 in words is "four hundred eighty million, six hundred two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •