Base | Representation |
---|---|
bin | 11100101010101… |
… | …101111110011101 |
3 | 1020112000022122122 |
4 | 130222231332131 |
5 | 1441111213123 |
6 | 115420352325 |
7 | 14630044643 |
oct | 3452557635 |
9 | 1215008578 |
10 | 480960413 |
11 | 22754274a |
12 | 1150a56a5 |
13 | 78849b7b |
14 | 47c3b193 |
15 | 2c356bc8 |
hex | 1caadf9d |
480960413 has 8 divisors (see below), whose sum is σ = 510094008. Its totient is φ = 451920384.
The previous prime is 480960409. The next prime is 480960419. The reversal of 480960413 is 314069084.
It can be written as a sum of positive squares in 4 ways, for example, as 86620249 + 394340164 = 9307^2 + 19858^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 480960413 - 22 = 480960409 is a prime.
It is a super-3 number, since 3×4809604133 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (480960419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12656 + ... + 33497.
It is an arithmetic number, because the mean of its divisors is an integer number (63761751).
Almost surely, 2480960413 is an apocalyptic number.
It is an amenable number.
480960413 is a deficient number, since it is larger than the sum of its proper divisors (29133595).
480960413 is a wasteful number, since it uses less digits than its factorization.
480960413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46783.
The product of its (nonzero) digits is 20736, while the sum is 35.
The square root of 480960413 is about 21930.8096749755. The cubic root of 480960413 is about 783.4953872460.
The spelling of 480960413 in words is "four hundred eighty million, nine hundred sixty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •