Base | Representation |
---|---|
bin | 110111001100111101110010… |
… | …0000011010100000011100101 |
3 | 2100200020202110012022201210012 |
4 | 1232121323210003110003211 |
5 | 1002121012314020141223 |
6 | 4440414232145140005 |
7 | 204164030241524306 |
oct | 15631734403240345 |
9 | 2320222405281705 |
10 | 485567058755813 |
11 | 130797918a62541 |
12 | 4656219562a605 |
13 | 17ac2a14587958 |
14 | 87c97dcd107ad |
15 | 3b20aa8192c78 |
hex | 1b99ee40d40e5 |
485567058755813 has 2 divisors, whose sum is σ = 485567058755814. Its totient is φ = 485567058755812.
The previous prime is 485567058755797. The next prime is 485567058755839. The reversal of 485567058755813 is 318557850765584.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 467477067803524 + 18089990952289 = 21621218^2 + 4253233^2 .
It is a cyclic number.
It is not a de Polignac number, because 485567058755813 - 24 = 485567058755797 is a prime.
It is a super-2 number, since 2×4855670587558132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (485567058758813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 242783529377906 + 242783529377907.
It is an arithmetic number, because the mean of its divisors is an integer number (242783529377907).
Almost surely, 2485567058755813 is an apocalyptic number.
It is an amenable number.
485567058755813 is a deficient number, since it is larger than the sum of its proper divisors (1).
485567058755813 is an equidigital number, since it uses as much as digits as its factorization.
485567058755813 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5644800000, while the sum is 77.
The spelling of 485567058755813 in words is "four hundred eighty-five trillion, five hundred sixty-seven billion, fifty-eight million, seven hundred fifty-five thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •