Base | Representation |
---|---|
bin | 10011011100101111001010… |
… | …110001100001110101000001 |
3 | 102012212022200200121202122120 |
4 | 103130233022301201311001 |
5 | 42202422124433243324 |
6 | 501531244332554453 |
7 | 24005615225554032 |
oct | 2334571261416501 |
9 | 365768620552576 |
10 | 85537675681089 |
11 | 25289362a60a15 |
12 | 9715936622a29 |
13 | 3896225718468 |
14 | 171a08d16ca89 |
15 | 9d507069d179 |
hex | 4dcbcac61d41 |
85537675681089 has 4 divisors (see below), whose sum is σ = 114050234241456. Its totient is φ = 57025117120724.
The previous prime is 85537675681033. The next prime is 85537675681127. The reversal of 85537675681089 is 98018657673558.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 85537675681089 - 221 = 85537673583937 is a prime.
It is not an unprimeable number, because it can be changed into a prime (85537675681789) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14256279280179 + ... + 14256279280184.
It is an arithmetic number, because the mean of its divisors is an integer number (28512558560364).
Almost surely, 285537675681089 is an apocalyptic number.
It is an amenable number.
85537675681089 is a deficient number, since it is larger than the sum of its proper divisors (28512558560367).
85537675681089 is a wasteful number, since it uses less digits than its factorization.
85537675681089 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28512558560366.
The product of its (nonzero) digits is 3048192000, while the sum is 78.
The spelling of 85537675681089 in words is "eighty-five trillion, five hundred thirty-seven billion, six hundred seventy-five million, six hundred eighty-one thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •