Base | Representation |
---|---|
bin | 11100111110110… |
… | …010001111101101 |
3 | 1020212220120112002 |
4 | 130332302033231 |
5 | 1443433031111 |
6 | 120125222045 |
7 | 15022544204 |
oct | 3476621755 |
9 | 1225816462 |
10 | 486220781 |
11 | 22a505962 |
12 | 116a01925 |
13 | 7996c307 |
14 | 4880a23b |
15 | 2ca4563b |
hex | 1cfb23ed |
486220781 has 12 divisors (see below), whose sum is σ = 506281212. Its totient is φ = 466784448.
The previous prime is 486220739. The next prime is 486220783. The reversal of 486220781 is 187022684.
It can be written as a sum of positive squares in 2 ways, for example, as 138062500 + 348158281 = 11750^2 + 18659^2 .
It is not a de Polignac number, because 486220781 - 26 = 486220717 is a prime.
It is a super-2 number, since 2×4862207812 = 472821295752499922, which contains 22 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 (486220783) 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 11 ways as a sum of consecutive naturals, for example, 115001 + ... + 119153.
It is an arithmetic number, because the mean of its divisors is an integer number (42190101).
Almost surely, 2486220781 is an apocalyptic number.
It is an amenable number.
486220781 is a deficient number, since it is larger than the sum of its proper divisors (20060431).
486220781 is an equidigital number, since it uses as much as digits as its factorization.
486220781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4300 (or 4253 counting only the distinct ones).
The product of its (nonzero) digits is 43008, while the sum is 38.
The square root of 486220781 is about 22050.4145312509. The cubic root of 486220781 is about 786.3414557751.
The spelling of 486220781 in words is "four hundred eighty-six million, two hundred twenty thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •