Base | Representation |
---|---|
bin | 11100111100001… |
… | …101100110001001 |
3 | 1020211122022102011 |
4 | 130330031212021 |
5 | 1443244441002 |
6 | 120102535521 |
7 | 15014035051 |
oct | 3474154611 |
9 | 1224568364 |
10 | 485546377 |
11 | 22a0951a8 |
12 | 1167375a1 |
13 | 79794364 |
14 | 486b2561 |
15 | 2c9608d7 |
hex | 1cf0d989 |
485546377 has 2 divisors, whose sum is σ = 485546378. Its totient is φ = 485546376.
The previous prime is 485546371. The next prime is 485546381. The reversal of 485546377 is 773645584.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 380094016 + 105452361 = 19496^2 + 10269^2 .
It is a cyclic number.
It is not a de Polignac number, because 485546377 - 27 = 485546249 is a prime.
It is a super-2 number, since 2×4855463772 = 471510568435652258, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 485546377.
It is not a weakly prime, because it can be changed into another prime (485546371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 242773188 + 242773189.
It is an arithmetic number, because the mean of its divisors is an integer number (242773189).
Almost surely, 2485546377 is an apocalyptic number.
It is an amenable number.
485546377 is a deficient number, since it is larger than the sum of its proper divisors (1).
485546377 is an equidigital number, since it uses as much as digits as its factorization.
485546377 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2822400, while the sum is 49.
The square root of 485546377 is about 22035.1169046139. The cubic root of 485546377 is about 785.9777271841.
The spelling of 485546377 in words is "four hundred eighty-five million, five hundred forty-six thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •