Base | Representation |
---|---|
bin | 11100101000010… |
… | …110011110000001 |
3 | 1020110211210101111 |
4 | 130220112132001 |
5 | 1440431333331 |
6 | 115355203321 |
7 | 14621551462 |
oct | 3450263601 |
9 | 1213753344 |
10 | 480339841 |
11 | 227159483 |
12 | 114a46541 |
13 | 78690577 |
14 | 47b18d69 |
15 | 2c282db1 |
hex | 1ca16781 |
480339841 has 8 divisors (see below), whose sum is σ = 486843840. Its totient is φ = 473853072.
The previous prime is 480339767. The next prime is 480339851. The reversal of 480339841 is 148933084.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 480339841 - 215 = 480307073 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 480339794 and 480339803.
It is not an unprimeable number, because it can be changed into a prime (480339851) 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 7 ways as a sum of consecutive naturals, for example, 57775 + ... + 65563.
It is an arithmetic number, because the mean of its divisors is an integer number (60855480).
Almost surely, 2480339841 is an apocalyptic number.
It is an amenable number.
480339841 is a deficient number, since it is larger than the sum of its proper divisors (6503999).
480339841 is an equidigital number, since it uses as much as digits as its factorization.
480339841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8615.
The product of its (nonzero) digits is 82944, while the sum is 40.
The square root of 480339841 is about 21916.6567021524. The cubic root of 480339841 is about 783.1582669386.
It can be divided in two parts, 4803 and 39841, that added together give a palindrome (44644).
The spelling of 480339841 in words is "four hundred eighty million, three hundred thirty-nine thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •