Base | Representation |
---|---|
bin | 10011011100010010100000… |
… | …010111111111110010111011 |
3 | 102012202101020211221112102111 |
4 | 103130102200113333302323 |
5 | 42201421112242331242 |
6 | 501505154414113151 |
7 | 24003445453143115 |
oct | 2334224027776273 |
9 | 365671224845374 |
10 | 85506899573947 |
11 | 252772aa716125 |
12 | 970b9877ab7b7 |
13 | 389335c617787 |
14 | 17187ada183b5 |
15 | 9d436d86b817 |
hex | 4dc4a05ffcbb |
85506899573947 has 2 divisors, whose sum is σ = 85506899573948. Its totient is φ = 85506899573946.
The previous prime is 85506899573941. The next prime is 85506899573951. The reversal of 85506899573947 is 74937599860558.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 85506899573947 - 27 = 85506899573819 is a prime.
It is a super-2 number, since 2×855068995739472 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (85506899573941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 42753449786973 + 42753449786974.
It is an arithmetic number, because the mean of its divisors is an integer number (42753449786974).
Almost surely, 285506899573947 is an apocalyptic number.
85506899573947 is a deficient number, since it is larger than the sum of its proper divisors (1).
85506899573947 is an equidigital number, since it uses as much as digits as its factorization.
85506899573947 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20575296000, while the sum is 85.
The spelling of 85506899573947 in words is "eighty-five trillion, five hundred six billion, eight hundred ninety-nine million, five hundred seventy-three thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •