Base | Representation |
---|---|
bin | 11101000000110… |
… | …100110001110001 |
3 | 1020220220201221022 |
4 | 131000310301301 |
5 | 1444102133231 |
6 | 120144505225 |
7 | 15030232034 |
oct | 3500646161 |
9 | 1226821838 |
10 | 486755441 |
11 | 22a840627 |
12 | 11701b215 |
13 | 79ac8793 |
14 | 4890901b |
15 | 2caedc7b |
hex | 1d034c71 |
486755441 has 4 divisors (see below), whose sum is σ = 515388132. Its totient is φ = 458122752.
The previous prime is 486755431. The next prime is 486755483. The reversal of 486755441 is 144557684.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 222010000 + 264745441 = 14900^2 + 16271^2 .
It is a cyclic number.
It is not a de Polignac number, because 486755441 - 210 = 486754417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 486755392 and 486755401.
It is not an unprimeable number, because it can be changed into a prime (486755411) 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 3 ways as a sum of consecutive naturals, for example, 14316320 + ... + 14316353.
It is an arithmetic number, because the mean of its divisors is an integer number (128847033).
Almost surely, 2486755441 is an apocalyptic number.
It is an amenable number.
486755441 is a deficient number, since it is larger than the sum of its proper divisors (28632691).
486755441 is a wasteful number, since it uses less digits than its factorization.
486755441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28632690.
The product of its digits is 537600, while the sum is 44.
The square root of 486755441 is about 22062.5347818423. The cubic root of 486755441 is about 786.6295768167.
The spelling of 486755441 in words is "four hundred eighty-six million, seven hundred fifty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •