Base | Representation |
---|---|
bin | 10011011100000111000111… |
… | …100001000011011100100001 |
3 | 102012201012200122101210021112 |
4 | 103130013013201003130201 |
5 | 42201221041331421404 |
6 | 501455413153033105 |
7 | 24002533441053014 |
oct | 2334070741033441 |
9 | 365635618353245 |
10 | 85494671357729 |
11 | 252720a515a307 |
12 | 9709534555795 |
13 | 38921610c988a |
14 | 1717d6d99137b |
15 | 9d3da506b56e |
hex | 4dc1c7843721 |
85494671357729 has 2 divisors, whose sum is σ = 85494671357730. Its totient is φ = 85494671357728.
The previous prime is 85494671357653. The next prime is 85494671357743. The reversal of 85494671357729 is 92775317649458.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70260270979600 + 15234400378129 = 8382140^2 + 3903127^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-85494671357729 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 85494671357729.
It is not a weakly prime, because it can be changed into another prime (85494671357629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 42747335678864 + 42747335678865.
It is an arithmetic number, because the mean of its divisors is an integer number (42747335678865).
Almost surely, 285494671357729 is an apocalyptic number.
It is an amenable number.
85494671357729 is a deficient number, since it is larger than the sum of its proper divisors (1).
85494671357729 is an equidigital number, since it uses as much as digits as its factorization.
85494671357729 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3200601600, while the sum is 77.
The spelling of 85494671357729 in words is "eighty-five trillion, four hundred ninety-four billion, six hundred seventy-one million, three hundred fifty-seven thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •