Base | Representation |
---|---|
bin | 10011100000101110011001… |
… | …011110000100110110111101 |
3 | 102020211112001202101222200001 |
4 | 103200232121132010312331 |
5 | 42221414403424430203 |
6 | 502301210215034301 |
7 | 24034456401355405 |
oct | 2340563136046675 |
9 | 366745052358601 |
10 | 85811726405053 |
11 | 253846044a3040 |
12 | 975aa7966b991 |
13 | 38b601b45345c |
14 | 1729449c21805 |
15 | 9dc25eb7791d |
hex | 4e0b99784dbd |
85811726405053 has 8 divisors (see below), whose sum is σ = 93615828344640. Its totient is φ = 78008130449280.
The previous prime is 85811726405039. The next prime is 85811726405077. The reversal of 85811726405053 is 35050462711858.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 85811726405053 - 29 = 85811726404541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 85811726404985 and 85811726405003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (85811726405453) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 126141300 + ... + 126819757.
It is an arithmetic number, because the mean of its divisors is an integer number (11701978543080).
Almost surely, 285811726405053 is an apocalyptic number.
It is an amenable number.
85811726405053 is a deficient number, since it is larger than the sum of its proper divisors (7804101939587).
85811726405053 is a wasteful number, since it uses less digits than its factorization.
85811726405053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252991907.
The product of its (nonzero) digits is 8064000, while the sum is 55.
The spelling of 85811726405053 in words is "eighty-five trillion, eight hundred eleven billion, seven hundred twenty-six million, four hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •