Base | Representation |
---|---|
bin | 10011011111100101010100… |
… | …111000010001100110011101 |
3 | 102020120000112201202022112211 |
4 | 103133211110320101212131 |
5 | 42214123212123440012 |
6 | 502201152505200421 |
7 | 24026011155044332 |
oct | 2337452470214635 |
9 | 366500481668484 |
10 | 85733266233757 |
11 | 2535430180006a |
12 | 9747821490111 |
13 | 38ab7c63474ac |
14 | 1725725796989 |
15 | 9da1bb96e6a7 |
hex | 4df954e1199d |
85733266233757 has 16 divisors (see below), whose sum is σ = 89566934833152. Its totient is φ = 81966393405360.
The previous prime is 85733266233749. The next prime is 85733266233763. The reversal of 85733266233757 is 75733266233758.
It is a cyclic number.
It is not a de Polignac number, because 85733266233757 - 23 = 85733266233749 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 85733266233692 and 85733266233701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85733266233737) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136433758 + ... + 137060704.
It is an arithmetic number, because the mean of its divisors is an integer number (5597933427072).
Almost surely, 285733266233757 is an apocalyptic number.
It is an amenable number.
85733266233757 is a deficient number, since it is larger than the sum of its proper divisors (3833668599395).
85733266233757 is a wasteful number, since it uses less digits than its factorization.
85733266233757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680208.
The product of its digits is 800150400, while the sum is 67.
Subtracting from 85733266233757 its reverse (75733266233758), we obtain a palindrome (9999999999999).
The spelling of 85733266233757 in words is "eighty-five trillion, seven hundred thirty-three billion, two hundred sixty-six million, two hundred thirty-three thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •