Base | Representation |
---|---|
bin | 11100111100001… |
… | …111101101100111 |
3 | 1020211122202022021 |
4 | 130330033231213 |
5 | 1443300230142 |
6 | 120103044011 |
7 | 15014102245 |
oct | 3474175547 |
9 | 1224582267 |
10 | 485555047 |
11 | 22a0a076a |
12 | 116740607 |
13 | 797982a3 |
14 | 486b5795 |
15 | 2c963267 |
hex | 1cf0fb67 |
485555047 has 8 divisors (see below), whose sum is σ = 513608544. Its totient is φ = 458080128.
The previous prime is 485555041. The next prime is 485555053. The reversal of 485555047 is 740555584.
It is an interprime number because it is at equal distance from previous prime (485555041) and next prime (485555053).
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 485555047 - 27 = 485554919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 485554994 and 485555012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (485555041) 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, 142918 + ... + 146275.
It is an arithmetic number, because the mean of its divisors is an integer number (64201068).
Almost surely, 2485555047 is an apocalyptic number.
485555047 is a deficient number, since it is larger than the sum of its proper divisors (28053497).
485555047 is a wasteful number, since it uses less digits than its factorization.
485555047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289289.
The product of its (nonzero) digits is 560000, while the sum is 43.
The square root of 485555047 is about 22035.3136351630. The cubic root of 485555047 is about 785.9824053409.
The spelling of 485555047 in words is "four hundred eighty-five million, five hundred fifty-five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •